A combined phase I-phase II scaled potential algorithm for linear programming

DOI10.1007/BF01582899MaRDI QIDQ1181908zbMATH OpenFDO

Authors Kurt M. Anstreicher

Publication date 27 June 1992

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

zbMATH Keywords

optimalityfeasibilitylower bounding procedurescaled potential algorithm

Mathematics Subject Classification ID

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

Recommendations

• Combining phase I and phase II in a potential reduction algorithm for linear programming
• A combined phase I-phase II projective algorithm for linear programming
• Publication:4887688
• New algorithms for linear programming

Cites work

• scientific article; zbMATH DE number 4151220 (Why is no real title available?)
• A combined phase I-phase II projective algorithm for linear programming
• A monotonic projective algorithm for fractional linear programming
• A new polynomial-time algorithm for linear programming
• A polynomial Newton method for linear programming
• A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start
• A variant of Karmarkar's linear programming algorithm for problems in standard form
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• An extension of Karmarkar's algorithm for linear programming using dual variables
• Conical projection algorithms for linear programming
• Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method
• Linear updates for a single-phase projective method
• On Anstreicher's combined phase I-phase II projective algorithm for linear programming
• Polynomial affine algorithms for linear programming
• Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
• Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
• Theoretical efficiency of a shifted-barrier-function algorithm for linear programming

Cited in

(10)

• A primal-dual potential reduction method for problems involving matrix inequalities
• Some variants of the Todd low-complexity algorithm
• Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions
• An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
• Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
• New complexity results for the Iri-Imai method
• An improved general Phase-I method in linear programming
• On interior algorithms for linear programming with no regularity assumptions
• Potential-reduction methods in mathematical programming
• On monotonicity in the scaled potential algorithm for linear programming

This page was built for publication: A combined phase I-phase II scaled potential algorithm for linear programming

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