An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
- 111 Downloads
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.
- D. Avis and V. Chvátal, “Notes on Bland's pivoting rule,”Mathematical Programming Study 8 (1978) 24–34.Google Scholar
- J.R. Bitner, G. Ehrlich and E.M. Reingold, “Efficient generation of the binary reflected Gray code and its applications,”Communications of the ACM 19 (1976) 517–521.Google Scholar
- R.G. Bland, “A new pivoting rule for the simplex method,”Mathematics of Operations Research 2 (1977) 103–107.Google Scholar
- D. Goldfarb and W.Y. Sit, “Worst case behaviour of the steepest edge simplex method,”Discrete Applied Mathematics 1 (1979) 277–285.Google Scholar
- D.L. Jensen and R.G. Bland, “Combinatorial pivot rules for oriented matroid programming,” paper presented on the 12th International Symposium on Mathematical Programming (Boston, 1985).Google Scholar
- V. Klee and G.J. Minty, “How good is the Simplex algorithm?“ in: O. Shisha, ed.,Inequalities III (Academic Press, New York, 1972) pp. 158–172.Google Scholar
- J.K. Lenstra and A.H.G. Rinnooy Kan, “A recursive approach to the generation of combinatorial configurations,” Report No. BW 50/75, Mathematisch Centrum (Amsterdam, 1975).Google Scholar
- C. Roos, “An exponential example for Terlaky's pivoting rule for the criss-cross simplex method,” Working paper, Delft University of Technology (Delft, 1987).Google Scholar
- T. Terlaky, “A new, finite criss-cross method,”Optimization 16 (1985) 683–690.Google Scholar
- S. Zionts, “The criss-cross method for solving linear programming problems,”Management Science 15 (1979) 426–445.Google Scholar