Determining basic variables of optimal solutions in Karmarkar's new LP algorithm

DOI10.1007/BF01840459zbMath0661.90057OpenAlexW2081885588MaRDI QIDQ1113799

Kojima, Masakazu

Publication date: 1986

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01840459

zbMATH Keywords

optimal basisKarmarkar's algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items

Introduction: New approaches to linear programming, An optimal-basis identification technique for interior-point linear programming algorithms, On the finite convergence of interior-point algorithms for linear programming, Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem, 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

Cites Work

• A new polynomial-time algorithm for linear programming
• Unnamed Item