A potential-function reduction algorithm for solving a linear program directly from an infeasible “warm start”
- 1 May 1991
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 52 (1) , 441-466
- https://doi.org/10.1007/bf01582900
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On Anstreicher's combined phase I—phase II projective algorithm for linear programmingMathematical Programming, 1992
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential functionMathematical Programming, 1991
- Theoretical efficiency of a shifted-barrier-function algorithm for linear programmingLinear Algebra and its Applications, 1991
- An O(n 3 L) potential reduction algorithm for linear programmingMathematical Programming, 1991
- Polynomial affine algorithms for linear programmingMathematical Programming, 1990
- A Centered Projective Algorithm for Linear ProgrammingMathematics of Operations Research, 1990
- A combined phase I-phase II projective algorithm for linear programmingMathematical Programming, 1989
- A monotonic projective algorithm for fractional linear programmingAlgorithmica, 1986
- An extension of Karmarkar's algorithm for linear programming using dual variablesAlgorithmica, 1986
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984