An exponential example for Terlaky's pivoting rule for the criss-cross simplex method (Q911455): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q56080060, #quickstatements; #temporary_batch_1707337057885 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56080060 / rank | |||
Normal rank | |||
Revision as of 21:47, 7 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exponential example for Terlaky's pivoting rule for the criss-cross simplex method |
scientific article |
Statements
An exponential example for Terlaky's pivoting rule for the criss-cross simplex method (English)
0 references
1990
0 references
This paper shows that the required number of iterations for Terlaky's pivoting rule for the criss-cross simplex method [see \textit{E. Klafszky} and \textit{T. Terlaky}, Alkalmazott Mat. Lapok 12, 1-14 (1986; Zbl 0631.90039)] may be exponential in the number of variables and constraints of the linear programming problem.
0 references
Gray code
0 references
Terlaky's pivoting rule
0 references
criss-cross simplex method
0 references
