Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program

DOI10.1016/0167-6377(91)90040-VzbMath0748.90039OpenAlexW2075608398MaRDI QIDQ1180819

Yinyu Ye, John A. Kaliski

Publication date: 27 June 1992

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

Full work available at URL: https://doi.org/10.1016/0167-6377(91)90040-v

zbMATH Keywords

convergence behaviorKarmarkar's projective algorithm

Mathematics Subject Classification ID

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

Related Items (2)

Log-Barrier Interior Point Methods Are Not Strongly Polynomial ⋮ On the number of iterations of Karmarkar's algorithm for linear programming

Cites Work

• A new polynomial-time algorithm for linear programming
• On the improvement per iteration in Karmarkar's algorithm for linear programming
• The Worst-Case Step in Karmarkar's Algorithm

This page was built for publication: Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program