Interior point algorithms for linear programming with inequality constraints

DOI10.1007/BF01582888zbMath0744.90052MaRDI QIDQ1181732

Clóvis C. Gonzaga

Publication date: 27 June 1992

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

Karmarkar's algorithmgeometric featuresprojective algorithmconical projectionInterior methods

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Interior-point algorithms for semi-infinite programming, Potential reduction method for harmonically convex programming, New complexity results for the Iri-Imai method, An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities, A study of the dual affine scaling continuous trajectories for linear programming, A survey of search directions in interior point methods for linear programming, On the number of iterations of Karmarkar's algorithm for linear programming

Cites Work

• A monotonic projective algorithm for fractional linear programming
• A new polynomial-time algorithm for linear programming
• An extension of Karmarkar's algorithm for linear programming using dual variables
• A multiplicative barrier function method for linear programming
• Conical projection algorithms for linear programming
• Polynomial affine algorithms for linear programming
• An implementation of Karmarkar's algorithm for linear programming
• Search directions for interior linear-programming methods
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method