On the Bartels—Golub decomposition for linear programming bases
- 1 December 1977
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 13 (1) , 272-279
- https://doi.org/10.1007/bf01584343
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A practicable steepest-edge simplex algorithmMathematical Programming, 1977
- USING THE STEEPEST-EDGE SIMPLEX ALGORITHM TO SOLVE SPARSE LINEAR PROGRAMSPublished by Elsevier ,1976
- On pricing and backward transformation in linear programmingMathematical Programming, 1974
- 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
- A stabilization of the simplex methodNumerische Mathematik, 1971
- The simplex method of linear programming using LU decompositionCommunications of the ACM, 1969
- The Composite Simplex AlgorithmSIAM Review, 1965