On interior algorithms for linear programming with no regularity assumptions

DOI10.1016/0167-6377(92)90026-YzbMath0760.90068OpenAlexW2021395303MaRDI QIDQ1197904

Kurt M. Anstreicher

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0167-6377(92)90026-y

zbMATH Keywords

interior methodsartificial variablephase I-phase II algorithm

Mathematics Subject Classification ID

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

Related Items

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 homogeneous model for monotone mixed horizontal linear complementarity problems, A projective algorithm for linear programming with no regularity condition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence behavior of interior-point algorithms
• A new polynomial-time algorithm for linear programming
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• A polynomial Newton method for linear programming
• A relaxed version of Karmarkar's method
• A combined phase I-phase II projective algorithm for linear programming
• A combined phase I-phase II scaled potential algorithm for linear programming
• On Anstreicher's combined phase I-phase II projective algorithm for linear programming
• Combining phase I and phase II in a potential reduction algorithm for linear programming
• Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method