Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
- 1 January 1988
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 40-40 (1-3) , 183-195
- https://doi.org/10.1007/bf01580729
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A relaxed version of Karmarkar's methodMathematical Programming, 1988
- A variant of Karmarkar's linear programming algorithm for problems in standard formMathematical Programming, 1987
- An experimental approach to karmarkar’s projective method for linear programmingPublished by Springer Nature ,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
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least SquaresACM Transactions on Mathematical Software, 1982