A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm
- 1 May 1990
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 47 (1-3) , 337-351
- https://doi.org/10.1007/bf01580868
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Conical projection algorithms for linear programmingMathematical Programming, 1989
- Computing Karmarkar projections quicklyMathematical Programming, 1988
- Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programmingMathematical Programming, 1987
- A variable-metric variant of the Karmarkar algorithm for linear programmingMathematical Programming, 1987
- 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 strengthened acceptance criterion for approximate projections in Karmarkar's algorithmOperations Research Letters, 1986
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984