On the bigℳ in the affine scaling algorithm
- 1 February 1993
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 62 (1) , 85-93
- https://doi.org/10.1007/bf01585161
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A little theorem of the bigℳ in interior point algorithmsMathematical Programming, 1993
- Global convergence of the affine scaling methods for degenerate linear programming problemsMathematical Programming, 1991
- Local Convergence Properties of New Methods in Linear ProgrammingJournal of the Operations Research Society of Japan, 1990
- An implementation of Karmarkar's algorithm for linear programmingMathematical Programming, 1989
- Affine-scaling for linear programs with free variablesMathematical Programming, 1989
- A modification of karmarkar's linear programming algorithmAlgorithmica, 1986
- A variation on Karmarkar’s algorithm for solving linear programming problemsMathematical Programming, 1986
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984