Klee-Minty's LP and upper bounds for Dantzig's simplex method (Q2275570): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1101.3821 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3844775 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A bound for the number of different basic solutions generated by the simplex method / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4051879 / rank | |||
Normal rank | |||
Latest revision as of 09:47, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Klee-Minty's LP and upper bounds for Dantzig's simplex method |
scientific article |
Statements
Klee-Minty's LP and upper bounds for Dantzig's simplex method (English)
0 references
9 August 2011
0 references
simplex method
0 references
linear programming
0 references
basic feasible solutions
0 references
Klee-Minty's LP
0 references
