Find out how to access previewonly content
, Volume 24, Issue 1, pp 5569
First online:
A sparsityexploiting variant of the Bartels—Golub decomposition for linear programming bases
 J. K. ReidAffiliated withComputer Science and Systems Division, A.E.R.E. Harwell
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
We describe a sparsityexploiting 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 fillins) 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 Title
 A sparsityexploiting variant of the Bartels—Golub decomposition for linear programming bases
 Journal

Mathematical Programming
Volume 24, Issue 1 , pp 5569
 Cover Date
 198212
 DOI
 10.1007/BF01585094
 Print ISSN
 00255610
 Online ISSN
 14364646
 Publisher
 SpringerVerlag
 Additional Links
 Topics
 Keywords

 Linear Programming
 Sparse LU Decomposition
 Updating Ip Basis Factorizations
 Bartels—Golub Decomposition
 Industry Sectors
 Authors

 J. K. Reid ^{(1)}
 Author Affiliations

 1. Computer Science and Systems Division, A.E.R.E. Harwell, Building 8.9, Didcot, Oxfordshire, England