An optimal-basis identification technique for interior-point linear programming algorithms
- 1 July 1991
- journal article
- research article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 152, 343-363
- https://doi.org/10.1016/0024-3795(91)90281-z
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Asymptotic behaviour of Karmarkar's method for linear programmingMathematical Programming, 1990
- An implementation of Karmarkar's algorithm for linear programmingMathematical Programming, 1989
- Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming AlgorithmMathematics of Operations Research, 1988
- Computational experience with a dual affine variant of Karmarkar's method for linear programmingOperations Research Letters, 1987
- Determining basic variables of optimal solutions in Karmarkar's new LP algorithmAlgorithmica, 1986
- A polynomial newton method for linear programmingAlgorithmica, 1986
- An extension of Karmarkar's algorithm for linear programming using dual variablesAlgorithmica, 1986
- A variation on Karmarkar’s algorithm for solving linear programming problemsMathematical Programming, 1986
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- Randomly generated polytopes for testing mathematical programming algorithmsMathematical Programming, 1983