Interior point algorithms for linear programming with inequality constraints (Q1181732): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementation of Karmarkar's algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A monotonic projective algorithm for fractional linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conical projection algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial affine algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search directions for interior linear-programming methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multiplicative barrier function method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of Karmarkar's algorithm for linear programming using dual variables / rank
 
Normal rank

Latest revision as of 13:29, 15 May 2024

scientific article
Language Label Description Also known as
English
Interior point algorithms for linear programming with inequality constraints
scientific article

    Statements

    Identifiers