An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
Recently T. Terlaky has proposed a new pivoting rule for the criss-cross simplex method for linear programming and he proved that his rule is convergent. In this note we show that the required number of iterations may be exponential in the number of variables and constraints of the problem.
Key wordsLinear programming pivoting rule Gray code
Unable to display preview. Download preview PDF.