Computational experience with a primal-dual interior point method for linear programming
- 1 July 1991
- journal article
- Published by Elsevier BV in Linear Algebra and its Applications
- Vol. 152, 191-222
- https://doi.org/10.1016/0024-3795(91)90275-2
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Further Development of a Primal-Dual Interior Point MethodINFORMS Journal on Computing, 1990
- Implementation of a Dual Affine Interior Point Algorithm for Linear ProgrammingINFORMS 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
- Interior path following primal-dual algorithms. part I: Linear programmingMathematical Programming, 1989
- Affine-scaling for linear programs with free variablesMathematical Programming, 1989
- Modification of the minimum-degree algorithm by multiple eliminationACM Transactions on Mathematical Software, 1985
- Analysis of mathematical programming problems prior to applying the simplex algorithmMathematical Programming, 1975