Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples (Q1121785)
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 4104711
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples |
scientific article; zbMATH DE number 4104711 |
Statements
Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples (English)
0 references
1989
0 references
Several pivoting rules of the simplex method are considered. Exponentiality is established by showing that the rules force the simplex method to pass through all the feasible vertices of Klee-Minty's examples. The pivoting rules considered can be described as follows: a queue variable entering the basis is always the first improving one in the queue. The rules differ among each other in the way the variable exiting the basis is placed in the queue.
0 references
speed of convergence
0 references
pivoting rules
0 references
simplex method
0 references
Exponentiality
0 references
Klee-Minty's examples
0 references
0.8338636755943298
0 references
0.8304004073143005
0 references
0.8167519569396973
0 references
0.783101499080658
0 references
