A projective simplex method for linear programming (Q1124875)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A projective simplex method for linear programming |
scientific article; zbMATH DE number 1371378
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A projective simplex method for linear programming |
scientific article; zbMATH DE number 1371378 |
Statements
A projective simplex method for linear programming (English)
0 references
29 November 1999
0 references
linear programming
0 references
simplex method
0 references
least squares problem
0 references
QR factorization
0 references
crash heuristic
0 references
0.8915709257125854
0 references
0.847518265247345
0 references
0.8112624287605286
0 references
0.8049569129943848
0 references
0.7978292107582092
0 references
