Zusammenfassung
Bevor wir mit der Ellipsoidmethode das erste Verfahren, mit dem man lineare Programme beweisbar in Polynomialzeit lösen kann, skizzieren, wollen wir erst noch unsere Betrachtungen zur Komplexität etwas vertiefen.
This is a preview of subscription content, log in via an institution to check access.
Literatur
Bland, R. G., Goldfarb, D., & Todd, M.J. (1981). The ellipsoid method: A survey. Operations Research, 29(6), 1039–1091.
Garey, M.R., & Johnson, D.S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman.
Grötschel, M., Lovász, L., & Schrijver, A. (1993). Geometric algorithms and combinatorial optimization (2nd sub ed.). Berlin: Springer.
Korte, B., & Schrader, R. (1984). Can the ellipsoid method be efficient? In H. Hauptmann, W. Krelle & K.C. Mosler (Eds.), Operations research and economic theory (pp. 337–343). Berlin: Springer.
Lawler, E.L. (1980). The great mathematical sputnik of 1979. The Mathematical Intelligencer, 2(4), 191–198.
Schrader, R. (1983). The ellipsoid method and its implications. Operations-Research-Spektrum, 5(1), 1–13.
Schrijver, A. (1986). Theory of linear and integer programming. Interscience Series in Discrete Mathematics and Optimization. Chichester: Wiley & Sons.
Traub, J.F., & Woźniakowski, H. (1981, 1982). Complexity of linear programming. Operations Research Letters, 1(2), 59–62.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer-Verlag GmbH Deutschland
About this chapter
Cite this chapter
Hochstättler, W. (2017). Die Ellipsoidmethode. In: Lineare Optimierung. Springer Spektrum, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-54425-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-54425-9_7
Published:
Publisher Name: Springer Spektrum, Berlin, Heidelberg
Print ISBN: 978-3-662-54424-2
Online ISBN: 978-3-662-54425-9
eBook Packages: Life Science and Basic Disciplines (German Language)