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 this page instead for the normal view: 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
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
