Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm (Q723482)
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: Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm |
scientific article; zbMATH DE number 6911929
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm |
scientific article; zbMATH DE number 6911929 |
Statements
Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm (English)
0 references
31 July 2018
0 references
linear programming
0 references
simplex algorithm
0 references
number of iterations
0 references
basic feasible solutions
0 references
NP-hardness
0 references
0 references
0.8268417119979858
0 references
0.8157246708869934
0 references
0.8126102089881897
0 references
0.7919628620147705
0 references
0.7843770384788513
0 references
