Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples (Q1121785)

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.