A different convergence proof of the projective method for linear programming

DOI10.1016/0167-6377(86)90025-8zbMath0617.90059OpenAlexW1987920272MaRDI QIDQ1088902

Manfred W. Padberg

Publication date: 1986

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(86)90025-8

zbMATH Keywords

projective transformationspolynomial-time algorithmproof of convergenceKarmarkar's algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (11)

The iterative step in the linear programming algorithm of N. Karmarkar ⋮ A projective method for linear programming with box-type constraints ⋮ A relaxed version of Karmarkar's method ⋮ Some remarks on Karmarkar's potential function ⋮ Convergence in Karmarkar's algorithm: a review ⋮ Karmarkar's algorithm with improved steps ⋮ On the improvement per iteration in Karmarkar's algorithm for linear programming ⋮ A primal projective interior point method for linear programming ⋮ A Modified Termination Rule for Karmarkar’s Algorithm ⋮ A circular cone relaxation primal interior point algorithm for LP ⋮ Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming

Cites Work

• A new polynomial-time algorithm for linear programming

This page was built for publication: A different convergence proof of the projective method for linear programming