An upper bound for the number of different solutions generated by the primal simplex method with any selection rule of entering variables (Q2846492)
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 6206135
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound for the number of different solutions generated by the primal simplex method with any selection rule of entering variables |
scientific article; zbMATH DE number 6206135 |
Statements
5 September 2013
0 references
linear programming
0 references
the number of basic solutions
0 references
pivoting rule
0 references
the simplex method
0 references
An upper bound for the number of different solutions generated by the primal simplex method with any selection rule of entering variables (English)
0 references
0.8590277433395386
0 references
0.8516448736190796
0 references
0.8491813540458679
0 references
0.8475753664970398
0 references
0.8223689794540405
0 references
