Interior point algorithms for linear programming with inequality constraints

DOI10.1007/BF01582888MaRDI QIDQ1181732zbMATH OpenFDO

Authors C. 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)

Recommendations

• Publication:4888203
• On the finite convergence of interior-point algorithms for linear programming
• An interior point method for linear programming
• scientific article; zbMATH DE number 4031392
• An interior point method for solving systems of linear equations and inequalities

Cites work

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

Cited in

(11)

• Interior-point algorithms for semi-infinite programming
• On the complexity of equalizing inequalities
• Potential reduction method for harmonically convex programming
• scientific article; zbMATH DE number 5968557 (Why is no real title available?)
• New complexity results for the Iri-Imai method
• scientific article; zbMATH DE number 169371 (Why is no real title available?)
• 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
• An Interior-Point Algorithm for Linearly Constrained Optimization
• A survey of search directions in interior point methods for linear programming
• On the number of iterations of Karmarkar's algorithm for linear programming

This page was built for publication: Interior point algorithms for linear programming with inequality constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1181732)