Recovering an optimal LP basis from an interior point solution
- 1 May 1994
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 15 (4) , 169-178
- https://doi.org/10.1016/0167-6377(94)90074-4
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Numerical Factorization Methods for Interior Point AlgorithmsINFORMS Journal on Computing, 1994
- Implementing the Simplex Method: The Initial BasisINFORMS Journal on Computing, 1992
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear ProgrammingSIAM Journal on Optimization, 1992
- Computational experience with a primal-dual interior point method for linear programmingLinear Algebra and its Applications, 1991
- On Finding Primal- and Dual-Optimal BasesINFORMS Journal on Computing, 1991
- Computing Sparse LU Factorizations for Large-Scale Linear Programming BasesINFORMS Journal on Computing, 1990
- Implementation of a Dual Affine Interior Point Algorithm for Linear ProgrammingINFORMS Journal on Computing, 1989
- Modification of the minimum-degree algorithm by multiple eliminationACM Transactions on Mathematical Software, 1985
- Pivot selection methods of the Devex LP codeMathematical Programming, 1973
- The Composite Simplex AlgorithmSIAM Review, 1965