A combined phase I-phase II scaled potential algorithm for linear programming
From MaRDI portal
Publication:1181908
DOI10.1007/BF01582899zbMATH Open0747.90060MaRDI QIDQ1181908FDOQ1181908
Publication date: 27 June 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start
- Theoretical efficiency of a shifted-barrier-function algorithm for linear programming
- A combined phase I-phase II projective algorithm for linear programming
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
- Conical projection algorithms for linear programming
- An extension of Karmarkar's algorithm for linear programming using dual variables
- A polynomial Newton method for linear programming
- A monotonic projective algorithm for fractional linear programming
- Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method
- Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
- A variant of Karmarkar's linear programming algorithm for problems in standard form
- Polynomial affine algorithms for linear programming
- On Anstreicher's combined phase I-phase II projective algorithm for linear programming
- Linear updates for a single-phase projective method
Cited In (9)
- 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
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)
