On interior algorithms for linear programming with no regularity assumptions

DOI10.1016/0167-6377(92)90026-YMaRDI QIDQ1197904zbMATH OpenOpenAlexFDO

Authors 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

artificial variableinterior methodsphase I-phase II algorithm

Mathematics Subject Classification ID

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

Recommendations

• An interior point method for linear programming
• A new polynomial-time algorithm for linear programming
• scientific article; zbMATH DE number 4031392
• A primal projective interior point method for linear programming
• A projective algorithm for linear programming with no regularity condition

Cites work

• A combined phase I-phase II projective algorithm for linear programming
• A combined phase I-phase II scaled potential algorithm for linear programming
• A new polynomial-time algorithm for linear programming
• A polynomial Newton method for linear programming
• A relaxed version of Karmarkar's method
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• Combining phase I and phase II in a potential reduction algorithm for linear programming
• Convergence behavior of interior-point algorithms
• scientific article; zbMATH DE number 4199962 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 4119923 (Why is no real title available?)
• Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method
• On Anstreicher's combined phase I-phase II projective algorithm for linear programming

Cited in

(4)

• A projective algorithm for linear programming with no regularity condition
• Potential-reduction methods in mathematical programming
• A homogeneous model for monotone mixed horizontal linear complementarity problems
• An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution

This page was built for publication: On interior algorithms for linear programming with no regularity assumptions

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