Steepest-edge rule and its number of simplex iterations for a nondegenerate LP (Q2294288)
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 7165769
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Steepest-edge rule and its number of simplex iterations for a nondegenerate LP |
scientific article; zbMATH DE number 7165769 |
Statements
Steepest-edge rule and its number of simplex iterations for a nondegenerate LP (English)
0 references
10 February 2020
0 references
linear programming
0 references
simplex method
0 references
steepest-edge rule
0 references
\(p\)-norm rule
0 references
simplex iteration
0 references
0.793108344078064
0 references
0.7621645331382751
0 references
0.7503377199172974
0 references
0.7503377199172974
0 references
0.7478488683700562
0 references
