A “build-down” scheme for linear programming
- 1 January 1990
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 46 (1-3) , 61-72
- https://doi.org/10.1007/bf01585727
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- An implementation of Karmarkar's algorithm for linear programmingMathematical Programming, 1989
- Conical projection algorithms for linear programmingMathematical Programming, 1989
- Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming AlgorithmMathematics of Operations Research, 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
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective methodMathematical Programming, 1986
- The Ellipsoid Method Generates Dual VariablesMathematics of Operations Research, 1985
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- A practicable steepest-edge simplex algorithmMathematical Programming, 1977
- An exact update for Harris’ TREADPublished by Springer Nature ,1975