Determining basic variables of optimal solutions in Karmarkar's new LP algorithm
From MaRDI portal
Publication:1113799
DOI10.1007/BF01840459zbMath0661.90057MaRDI QIDQ1113799
Publication date: 1986
Published in: Algorithmica (Search for Journal in Brave)
Related Items
On the finite convergence of interior-point algorithms for linear programming, Introduction: New approaches to linear programming, An optimal-basis identification technique for interior-point linear programming algorithms, 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, Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem
Cites Work