MOPS — Mathematical optimization system
- 27 January 1994
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 72 (2) , 312-322
- https://doi.org/10.1016/0377-2217(94)90312-3
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Computing Sparse LU Factorizations for Large-Scale Linear Programming BasesINFORMS Journal on Computing, 1990
- Finding duplicate rows in a linear programming modelOperations Research Letters, 1986
- A general Phase-I method in linear programmingEuropean Journal of Operational Research, 1986
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming basesMathematical Programming, 1982
- Solving staircase linear programs by the simplex method, 1: InversionMathematical Programming, 1982
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational resultsMathematical Programming, 1977
- A practicable steepest-edge simplex algorithmMathematical Programming, 1977
- Analysis of mathematical programming problems prior to applying the simplex algorithmMathematical Programming, 1975
- Pivot selection methods of the Devex LP codeMathematical Programming, 1973
- Updated triangular factors of the basis to maintain sparsity in the product form simplex methodMathematical Programming, 1972