Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
- 1 July 1991
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 51 (1), 203-222
- https://doi.org/10.1007/bf01586933
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 1988
- A variant of Karmarkar's linear programming algorithm for problems in standard formMathematical Programming, 1987
- 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