On the improvement per iteration in Karmarkar's algorithm for linear programming
From MaRDI portal
Publication:918862
DOI10.1007/BF01585747zbMath0706.90043OpenAlexW2089039041MaRDI QIDQ918862
Publication date: 1990
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585747
Numerical mathematical programming methods (65K05) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (3)
Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm ⋮ Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program ⋮ A Modified Termination Rule for Karmarkar’s Algorithm
Cites Work
- A monotonic projective algorithm for fractional linear programming
- A new polynomial-time algorithm for linear programming
- Asymptotic behaviour of Karmarkar's method for linear programming
- A different convergence proof of the projective method for linear programming
- The iterative step in the linear programming algorithm of N. Karmarkar
- An extension of Karmarkar's algorithm for linear programming using dual variables
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- On the Performance of Karmarkar's Algorithm
- The Worst-Case Step in Karmarkar's Algorithm
This page was built for publication: On the improvement per iteration in Karmarkar's algorithm for linear programming