A different convergence proof of the projective method for linear programming

DOI10.1016/0167-6377(86)90025-8zbMATH Open0617.90059OpenAlexW1987920272MaRDI QIDQ1088902FDOQ1088902

Authors: Manfred 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

polynomial-time algorithmprojective transformationsproof of convergenceKarmarkar's algorithm

Mathematics Subject Classification ID

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

Cites Work

• A new polynomial-time algorithm for linear programming

Cited In (12)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1088902)