Combining phase I and phase II in a potential reduction algorithm for linear programming
DOI10.1007/BF01581241zbMATH Open0777.90030OpenAlexW1985408040MaRDI QIDQ2368075FDOQ2368075
Authors: Michael J. Todd 
Publication date: 22 August 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01581241
Recommendations
- A combined phase I-phase II scaled potential algorithm for linear programming
- A Low Complexity Interior-Point Algorithm for Linear Programming
- An infeasible-interior-point potential-reduction algorithm for linear programming
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- Combining Interior-Point and Pivoting Algorithms for Linear Programming
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- A new polynomial-time algorithm for linear programming
- A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start
- Modified barrier functions (theory and methods)
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- Feasibility issues in a primal-dual interior-point method for linear programming
- 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
- Computational experience with a primal-dual interior point method for linear programming
- A monotonic projective algorithm for fractional linear programming
- A variant of Karmarkar's linear programming algorithm for problems in standard form
- A Family of Search Directions for Karmarkar's Algorithm
- On monotonicity in the scaled potential algorithm for linear programming
- Polynomial affine algorithms for linear programming
- On Anstreicher's combined phase I-phase II projective algorithm for linear programming
- On combined phase 1-phase 2 projective methods for linear programming
- Linear updates for a single-phase projective method
Cited In (9)
- A little theorem of the big \({\mathcal M}\) in interior point algorithms
- Feasible region contraction interior point algorithm
- A two-phase linear programming approach for redundancy allocation problems
- 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
- On interior algorithms for linear programming with no regularity assumptions
- Potential-reduction methods in mathematical programming
- Convergence and polynomiality of primal-dual interior-point algorithms for linear programming with selective addition of inequalities
- A Potential Reduction Algorithm with User-Specified Phase I–Phase II Balance for Solving a Linear Program from an Infeasible Warm Start
This page was built for publication: Combining phase I and phase II in a potential reduction algorithm for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368075)
