Computational results of an interior point algorithm for large scale linear programming
- 1 May 1991
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 52 (1-3) , 555-586
- https://doi.org/10.1007/bf01582905
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- The AT&TKorbx® SystemAT&T Technical Journal, 1989
- Data Structures and Programming Techniques for the Implementation of Karmarkar's AlgorithmINFORMS Journal on Computing, 1989
- An implementation of Karmarkar's algorithm for linear programmingMathematical Programming, 1989
- A relaxed version of Karmarkar's methodMathematical Programming, 1988
- Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective valueMathematical Programming, 1988
- A variable-metric variant of the Karmarkar algorithm for linear programmingMathematical Programming, 1987
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective methodMathematical Programming, 1986
- On the acyclic subgraph polytopeMathematical Programming, 1985
- Optimal triangulation of large real world input-output matricesStatistische Hefte, 1983
- Implementation and computational comparisons of primal, dual and primal‐dual computer codes for minimum cost network flow problemsNetworks, 1974