Recovering Optimal Basic Variables in Karmarkar's Polynomial Algorithm for Linear Programming

DOI10.1287/moor.15.3.564zbMath0708.90048OpenAlexW2140981834MaRDI QIDQ3491303

Yinyu Ye

Publication date: 1990

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.15.3.564

zbMATH Keywords

Karmarkar's projective algorithmoptimal basic variablesprimal-slack ellipsoids

Mathematics Subject Classification ID

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

Related Items

Designing menus of contracts efficiently: the power of randomization, Containing and shrinking ellipsoids in the path-following algorithm, On improved Choi-Goldfarb solution-containing ellipsoids in linear programming, Degeneracy in interior point methods for linear programming: A survey, On solution-containing ellipsoids in linear programming