An O(n 3 L) potential reduction algorithm for linear programming
- 1 March 1991
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 50 (1-3) , 239-258
- https://doi.org/10.1007/bf01594937
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Polynomial affine algorithms for linear programmingMathematical Programming, 1990
- An implementation of Karmarkar's algorithm for linear programmingMathematical Programming, 1989
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- A variant of Karmarkar's linear programming algorithm for problems in standard formMathematical Programming, 1987
- A monotonic projective algorithm for fractional linear programmingAlgorithmica, 1986
- A multiplicative barrier function method for linear programmingAlgorithmica, 1986
- A polynomial newton method for linear programmingAlgorithmica, 1986
- A variation on Karmarkar’s algorithm for solving linear programming problemsMathematical Programming, 1986
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective methodMathematical Programming, 1986
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984