A double-pivot simplex algorithm and its upper bounds of the iteration numbers (Q2214920)
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 double-pivot simplex algorithm and its upper bounds of the iteration numbers |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A double-pivot simplex algorithm and its upper bounds of the iteration numbers |
scientific article |
Statements
A double-pivot simplex algorithm and its upper bounds of the iteration numbers (English)
0 references
10 December 2020
0 references
double-pivot algorithm
0 references
simplex method
0 references
linear programming
0 references
Klee-Minty cube
0 references
0 references
0.8430882692337036
0 references
0.8205105066299438
0 references
0.7889865636825562
0 references
0.788730263710022
0 references
