A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- 1 December 1982
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 24 (1), 55-69
- https://doi.org/10.1007/bf01585094
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A bump triangular dynamic factorization algorithm for the simplex methodMathematical Programming, 1980
- Parameterization of the Environment for Transportable Numerical SoftwareACM Transactions on Mathematical Software, 1978
- On the Bartels—Golub decomposition for linear programming basesMathematical Programming, 1977
- A Comparison of Sparsity Orderings for Obtaining a Pivotal Sequence in Gaussian EliminationIMA Journal of Applied Mathematics, 1974
- On the Automatic Scaling of Matrices for Gaussian EliminationIMA Journal of Applied Mathematics, 1972
- Updated triangular factors of the basis to maintain sparsity in the product form simplex methodMathematical Programming, 1972
- Some Basic Techniques for Solving Sparse Systems of Linear EquationsPublished by Springer Science and Business Media LLC ,1972
- Reinversion with the preassigned pivot procedureMathematical Programming, 1971
- A stabilization of the simplex methodNumerische Mathematik, 1971
- The Elimination form of the Inverse and its Application to Linear ProgrammingManagement Science, 1957