Skip to main content
SpringerLink
Log in

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

  • Published:
Mathematical Programming Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Avis and V. Chvátal, “Notes on Bland's pivoting rule,”Mathematical Programming Study 8 (1978) 24–34.

    Google Scholar 

  2. 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 

  3. R.G. Bland, “A new pivoting rule for the simplex method,”Mathematics of Operations Research 2 (1977) 103–107.

    Google Scholar 

  4. D. Goldfarb and W.Y. Sit, “Worst case behaviour of the steepest edge simplex method,”Discrete Applied Mathematics 1 (1979) 277–285.

    Google Scholar 

  5. 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).

  6. 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 

  7. 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 

  8. 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 

  9. T. Terlaky, “A new, finite criss-cross method,”Optimization 16 (1985) 683–690.

    Google Scholar 

  10. S. Zionts, “The criss-cross method for solving linear programming problems,”Management Science 15 (1979) 426–445.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Informatics, Delft University of Technology, P.O. Box 356, 2600 AJ, Delft, The Netherlands

    C. Roos

Authors
  1. C. Roos
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Roos, C. An exponential example for Terlaky's pivoting rule for the criss-cross simplex method. Mathematical Programming 46, 79–84 (1990). https://doi.org/10.1007/BF01585729

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01585729

Key words

Search

Navigation