A projective algorithm for linear programming with no regularity condition

DOI10.1016/0167-6377(92)90014-TzbMath0759.90067OpenAlexW1997720042MaRDI QIDQ1200753

Jean-Philippe Vial

Publication date: 16 January 1993

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(92)90014-t

zbMATH Keywords

interior point algorithmphase I-phase II projective algorithm

Mathematics Subject Classification ID

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

Related Items

An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution, Linear updates for a single-phase projective method

Cites Work

• Unnamed Item
• A new polynomial-time algorithm for linear programming
• An extension of Karmarkar's algorithm for linear programming using dual variables
• A polynomial Newton method for linear programming
• On interior algorithms for linear programming with no regularity assumptions
• An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex