A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases (Q3955153)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3775258
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases |
scientific article; zbMATH DE number 3775258 |
Statements
A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases (English)
0 references
1982
0 references
test results
0 references
decompositions
0 references
updating lp basis factorizations
0 references
simplex method
0 references
implementation
0 references
Bartels and Golub algorithm
0 references
sparse matrices
0 references
Forrest and Fomlin algorithm
0 references
computational comparison
0 references
0 references
0 references
