Skip to main content
SpringerLink
Log in

Zur Komplexität des Simplexalgorithmus

  • Chapter
  • First Online:
Lineare Optimierung

  • 7009 Accesses

Zusammenfassung

Der Simplexalgorithmus hat sich seit seiner in der Praxis effizientes Verfahren etabliert. Aus Sicht der Theorie hat man dafür keine wirklich befriedigende Erklärung. Wir werden in diesem Kapitel einen ersten, einfacheren Komplexitätsbegriff kennen lernen und den Simplexalgorithmus aus dieser Warte betrachten.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Literaturverzeichnis

  1. Arora, S., & Barak, B. (2009). Computational complexity: A modern approach (1st ed.). Cambridge: Cambridge University Press.

    Google Scholar 

  2. Friedmann, O. (2011). Exponential lower bounds for solving infinitary payoff games and linear programs (PhD thesis). Ludwig-Maximilians-Universität, München.

    Google Scholar 

  3. Garey, M.R., & Johnson, D.S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman.

    Google Scholar 

  4. Goldfarb, D. (1983). Worst case complexity of the shadow vertex simplex algorithm (Technical report). New York: Columbia University.

    Google Scholar 

  5. Knuth, D.E. (1998). Art of computer programming, volume 3: Sorting and searching (2nd ed.). Reading, MA: Addison-Wesley Professional.

    Google Scholar 

  6. Papadimitriou, C.H. (1993). Computational complexity (1st ed.). Boston: Addison-Wesley.

    Google Scholar 

  7. Santos, F. (2012). A counterexample to the hirsch conjecture. Annals of Mathematics, 176(1), 383–412.

    Article  MathSciNet  Google Scholar 

  8. Schrijver, A. (1986). Theory of linear and integer programming. Interscience Series in Discrete Mathematics and Optimization. Chichester: Wiley & Sons.

    Google Scholar 

  9. Spielman, S., & Teng, S.-H. (2001). Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. In Proceedings of the thirty-third annual ACM symposium on theory of computing, STOC ’01 (pp. 296–305). New York: ACM.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät Mathematik und Informatik, FernUniversität in Hagen, Hagen, Deutschland

    Winfried Hochstättler

Authors
  1. Winfried Hochstättler
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer-Verlag GmbH Deutschland

About this chapter

Cite this chapter

Hochstättler, W. (2017). Zur Komplexität des Simplexalgorithmus. In: Lineare Optimierung. Springer Spektrum, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-54425-9_6

Download citation

Publish with us

Policies and ethics

Search

Navigation