Mathematical Programming

, Volume 46, Issue 1, pp 79–84

An exponential example for Terlaky's pivoting rule for the criss-cross simplex method

Authors

  • C. Roos
    • Department of Mathematics and InformaticsDelft University of Technology
Article

DOI: 10.1007/BF01585729

Cite this article as:
Roos, C. Mathematical Programming (1990) 46: 79. doi:10.1007/BF01585729

Abstract

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 words

Linear programming pivoting rule Gray code

Copyright information

© North-Holland 1990