A dual projective simplex method for linear programming (Q1129474)
From MaRDI portal
!
WARNING
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 1192696
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dual projective simplex method for linear programming |
scientific article; zbMATH DE number 1192696 |
Statements
A dual projective simplex method for linear programming (English)
0 references
2 March 1999
0 references
least squares problem
0 references
projective simplex method
0 references
dual crash heuristic
0 references
NETLIB
0 references
0 references
0 references
0 references
0.9048362970352172
0 references
0.8915709257125854
0 references
0.8271175622940063
0 references
0.8171665668487549
0 references
0.8068110346794128
0 references
