An exponential example for Terlaky's pivoting rule for the criss-cross simplex method (Q911455)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4141786
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exponential example for Terlaky's pivoting rule for the criss-cross simplex method |
scientific article; zbMATH DE number 4141786 |
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
0.8167519569396973
0 references
0.8107274174690247
0 references
0.7864519953727722
0 references
0.7795965075492859
0 references
0.7795959711074829
0 references
