Steepest-edge simplex algorithms for linear programming (Q1802952)
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 219852
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Steepest-edge simplex algorithms for linear programming |
scientific article; zbMATH DE number 219852 |
Statements
Steepest-edge simplex algorithms for linear programming (English)
0 references
29 June 1993
0 references
Devex variants
0 references
steepest-edge simplex algorithms
0 references
dual simplex method
0 references
0 references
0.8836268782615662
0 references
0.8418498039245605
0 references
0.8270893692970276
0 references
0.8230692744255066
0 references
0.8096892833709717
0 references
