Skip to main content
SpringerLink
Log in

Lineare Optimierung

  • Chapter
  • First Online:
Book cover Kombinatorische Optimierung

Part of the book series: Springer-Lehrbuch Masterclass ((MASTERCLASS))

  • 7160 Accesses

Zusammenfassung

In diesem Kapitel werden wir die wichtigsten Definitionen und Resultate der linearen Optimierung zusammenstellen. Es ist zwar in sich vollständig, kann jedoch nicht als eine umfassende Einführung in die lineare Optimierung betrachtet werden. Dem mit der linearen Optimierung nicht vertrauten Leser seien die am Ende des Kapitels angegebenen Texte empfohlen.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.95
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

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

    Article  Google Scholar 

  2. Bland, R.G.: New finite pivoting rules for the simplex method. Mathematics of Operations Research 2, 103–107 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  3. Borgwardt, K.-H.: The average number of pivot steps required by the simplex method is polynomial. Zeitschrift für Operations Research 26, 157–177 (1982)

    MathSciNet  MATH  Google Scholar 

  4. Carathéodory, C.: Über den Variabilitätsbereich der Fourierschen Konstanten von positiven harmonischen Funktionen. Rendiconto del Circolo Matematico di Palermo 32, 193–217 (1911)

    Article  MATH  Google Scholar 

  5. Dantzig, G.B.: Maximization of a linear function of variables subject to linear inequalities. In: Koopmans, T.C. (Hrsg.) Activity Analysis of Production and Allocation, S. 359–373. Wiley, New York (1951)

    Google Scholar 

  6. Dantzig, G.B., Orden, A., Wolfe, P.: The generalized simplex method for minimizing a linear form under linear inequality restraints. Pacific Journal of Mathematics 5, 183–195 (1955)

    Article  MathSciNet  MATH  Google Scholar 

  7. Farkas, G.: A Fourier-féle mechanikai elv alkalmazásai. Mathematikai és Természettudományi Értesitö 12, 457–472 (1894)

    Google Scholar 

  8. Gale, D., Kuhn, H.W., Tucker, A.W.: Linear programming and the theory of games. In: Koopmans, T.C. (Hrsg.) Activity Analysis of Production and Allocation, S. 317–329. Wiley, New York (1951)

    Google Scholar 

  9. Hoffman, A.J., Kruskal, J.B.: Integral boundary points of convex polyhedra. In: Kuhn, H.W., Tucker, A.W. (Hrsg.) Linear Inequalities and Related Systems. Annals of Mathematical Study, Bd. 38, S. 223–246. Princeton University Press, Princeton (1956)

    Google Scholar 

  10. Kelner, J.A., Spielman, D.A.: A randomized polynomial-time simplex algorithm for linear programming. Proceedings of the 38th Annual ACM Symposium on Theory of Computing, S. 51–60 (2006)

    Google Scholar 

  11. Klee, V., Minty, G.J.: How good is the simplex algorithm? In: Shisha, O. (Hrsg.) Inequalities III, S. 159–175. Academic Press, New York (1972)

    Google Scholar 

  12. Kuhn, H.W.: Solvability and consistency for linear equations and inequalities. The American Mathematical Monthly 63, 217–232 (1956)

    Article  MathSciNet  MATH  Google Scholar 

  13. Minkowski, H.: Geometrie der Zahlen. Teubner, Leipzig (1896)

    Google Scholar 

  14. Motzkin, T.S.: Beiträge zur Theorie der linearen Ungleichungen (Dissertation). Azriel, Jerusalem (1936)

    MATH  Google Scholar 

  15. von Neumann, J.: Discussion of a maximum problem. Working paper. In: Taub, A.H. (Hrsg.) John von Neumann, Collected Works, Vol. VI, S. 27–28. Pergamon Press, Oxford (1963)

    Google Scholar 

  16. Spielman, D.A., Teng, S.-H.: Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. Journal of the ACM 51, 385–463 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  17. Steinitz, E.: Bedingt konvergente Reihen und konvexe Systeme. Journal für die reine und angewandte Mathematik 146, 1–52 (1916)

    Google Scholar 

  18. Weyl, H.: Elementare Theorie der konvexen Polyeder. Commentarii Mathematici Helvetici 7, 290–306 (1935)

    Article  MathSciNet  MATH  Google Scholar 

Weiterführende Literatur

  1. Bertsimas, D., Tsitsiklis, J.N.: Introduction to Linear Optimization. Athena Scientific, Belmont (1997)

    Google Scholar 

  2. Chvátal, V.: Linear Programming. Freeman, New York (1983)

    MATH  Google Scholar 

  3. Matoušek, J., Gärtner, B.: Understanding and Using Linear Programming. Springer, Berlin (2007)

    MATH  Google Scholar 

  4. Padberg, M.: Linear Optimization and Extensions, 2. Aufl. Springer, Berlin (1999)

    MATH  Google Scholar 

  5. Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)

    MATH  Google Scholar 

Download references

Author information

Author notes

  1. Bernhard Korte & Jens Vygen

    Present address: Forschungsinstitut für Diskrete Mathematik, Universität Bonn, Lennestr. 2, 53113, Bonn, Deutschland

Authors and Affiliations

    Authors
    1. Bernhard Korte
      View author publications

      You can also search for this author in PubMed Google Scholar

    2. Jens Vygen
      View author publications

      You can also search for this author in PubMed Google Scholar

    Corresponding authors

    Correspondence to Bernhard Korte or Jens Vygen .

    Rights and permissions

    Reprints and permissions

    Copyright information

    © 2012 Springer-Verlag Berlin Heidelberg

    About this chapter

    Cite this chapter

    Korte, B., Vygen, J. (2012). Lineare Optimierung. In: Kombinatorische Optimierung. Springer-Lehrbuch Masterclass. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25401-7_3

    Download citation

    Publish with us

    Policies and ethics

    Search

    Navigation