A potential-function reduction algorithm for solving a linear program directly from an infeasible “warm start”
Robert M. Freund · Mathematical Programming · 1991
Cited by 38 works. doi:10.1007/bf01582900 Open-access PDF
Authors
References
- A new polynomial-time algorithm for linear programming
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- An extension of Karmarkar's algorithm for linear programming using dual variables
- An O(n 3 L) potential reduction algorithm for linear programming
- A Centered Projective Algorithm for Linear Programming
- Linear Programming in Single- and Multiple-Objective Systems
- A monotonic projective algorithm for fractional 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
- A combined phase I-phase II projective algorithm for linear programming