Recovering Optimal Basic Variables in Karmarkar's Polynomial Algorithm for Linear Programming
From MaRDI portal
Publication:3491303
DOI10.1287/moor.15.3.564zbMath0708.90048MaRDI QIDQ3491303
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
90C05: Linear programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Degeneracy in interior point methods for linear programming: A survey, On solution-containing ellipsoids in linear programming, On improved Choi-Goldfarb solution-containing ellipsoids in linear programming, Containing and shrinking ellipsoids in the path-following algorithm