An exponential example for Terlaky's pivoting rule for the criss-cross simplex method (Q911455): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01585729 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2067442388 / rank | |||
Normal rank | |||
Latest revision as of 11:11, 30 July 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
