# A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases

Article

- Received:
- Revised:

DOI: 10.1007/BF01585094

- Cite this article as:
- Reid, J.K. Mathematical Programming (1982) 24: 55. doi:10.1007/BF01585094

- 48 Citations
- 203 Downloads

## Abstract

We describe a sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases. It includes interchanges that, whenever this is possible, avoid the use of any eliminations (with consequent fill-ins) when revising the factorization at an iteration. Test results on some medium scale problems are presented and comparisons made with the algorithm of Forrest and Tomlin.

### Key words

Linear Programming Sparse LU Decomposition Updating Ip Basis Factorizations Bartels—Golub Decomposition## Copyright information

© The Mathematical Programming Society, Inc. 1982