A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases (Q3955153): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01585094 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1988390398 / rank | |||
Normal rank | |||
Latest revision as of 09:26, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases |
scientific article |
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
