Global convergence of the affine scaling methods for degenerate linear programming problems
- 1 May 1991
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 52 (1-3) , 377-404
- https://doi.org/10.1007/bf01582896
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Limiting behavior of the affine scaling continuous trajectories for linear programming problemsMathematical Programming, 1991
- Local Convergence Properties of New Methods in Linear ProgrammingJournal of the Operations Research Society of Japan, 1990
- Data Structures and Programming Techniques for the Implementation of Karmarkar's AlgorithmINFORMS Journal on Computing, 1989
- An Implementation of a Primal-Dual Interior Point Method for Linear ProgrammingINFORMS Journal on Computing, 1989
- An implementation of Karmarkar's algorithm for linear programmingMathematical Programming, 1989
- Boundary Behavior of Interior Point Algorithms in Linear ProgrammingMathematics of Operations Research, 1989
- Conical projection algorithms for linear programmingMathematical Programming, 1989
- Computational experience with a dual affine variant of Karmarkar's method for linear programmingOperations Research Letters, 1987
- A variation on Karmarkar’s algorithm for solving linear programming problemsMathematical Programming, 1986
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984