On Anstreicher's combined phase I-phase II projective algorithm for linear programming

DOI10.1007/BF01581187zbMath0773.90049OpenAlexW1964752420MaRDI QIDQ1194852

Michael J. Todd

Publication date: 6 October 1992

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

interior-point methodKarmarkar's projective algorithmcombining phase I-phase IItwo-constraint linear programming

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Combining phase I and phase II in a potential reduction algorithm for linear programming, Potential-reduction methods in mathematical programming, An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution, A combined phase I-phase II scaled potential algorithm for linear programming, A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start, On interior algorithms for linear programming with no regularity assumptions, On combined phase 1-phase 2 projective methods for linear programming, Linear updates for a single-phase projective method, An extension of the potential reduction algorithm for linear complementarity problems with some priority goals

Cites Work

• Unnamed Item
• A monotonic projective algorithm for fractional linear programming
• A new polynomial-time algorithm for linear programming
• A polynomial Newton method for linear programming
• A combined phase I-phase II projective algorithm for linear programming
• Conical projection algorithms for linear programming
• Search directions for interior linear-programming methods
• Linear Time Algorithms for Two- and Three-Variable Linear Programs
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• A variant of Karmarkar's linear programming algorithm for problems in standard form
• Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming