The worst-case running time of the random simplex algorithm is exponential in the height (Q671935)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The worst-case running time of the random simplex algorithm is exponential in the height |
scientific article |
Statements
The worst-case running time of the random simplex algorithm is exponential in the height (English)
0 references
27 February 1997
0 references
Linear programming
0 references
Algorithms
0 references
Simplex algorithm
0 references
Randomized algorithm
0 references
