Implementation of Interior-Point Methods for Large Scale Linear Programs
- 1 January 1996
- book chapter
- Published by Springer Nature
Abstract
No abstract availableThis publication has 55 references indexed in Scilit:
- Finding all linearly dependent rows in large-scale linear programmingOptimization Methods and Software, 1995
- Recovering an optimal LP basis from an interior point solutionOperations Research Letters, 1994
- Commentary—Progress in Linear ProgrammingINFORMS Journal on Computing, 1994
- Separable Quadratic Programming via a Primal-Dual Interior Point Method and its Use in a Sequential ProcedureINFORMS Journal on Computing, 1993
- Prior reduced fill-in in solving equations in interior point algorithmsOperations Research Letters, 1992
- On the augmented system approach to sparse least-squares problemsNumerische Mathematik, 1989
- Data Structures and Programming Techniques for the Implementation of Karmarkar's AlgorithmINFORMS Journal on Computing, 1989
- Solving Sparse Linear Systems with Sparse Backward ErrorSIAM Journal on Matrix Analysis and Applications, 1989
- Analysis of mathematical programming problems prior to applying the simplex algorithmMathematical Programming, 1975
- Direct Methods for Solving Symmetric Indefinite Systems of Linear EquationsSIAM Journal on Numerical Analysis, 1971