Skip to main content
SpringerLink
Log in
Book cover

Ottimizzazione Combinatoria pp 53–74Cite as

Programmazione lineare

  • Chapter

  • 536 Accesses

Part of the book series: UNITEXT ((UNITEXTMAT))

Riassunto

In questo capitolo presentiamo le nozioni più importanti della Programmazione Lineare. Anche se questo capitolo è indipendente, non può certo essere consi- derato un trattamento esaustivo sull’argomento. Il lettore con poche nozioni di Programmazione Lineare puo consultare i testi indicati alla fine di questo capitolo.

This is a preview of subscription content, 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   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Riferimenti bibliografici

Letteratura generale

  • Bertsimas, D., Tsitsiklis, J.N. [1997]: Introduction to Linear Optimization. Athena Scientific, Belmont

    Google Scholar 

  • Chvàtal, V. [1983]: Programmazione Lineare. Freeman, New York

    Google Scholar 

  • Matoušek, J., Gärtner, B. [2007]: Understanding and Using Linear Programming. Springer, Berlin

    MATH  Google Scholar 

  • Padberg, M. [1999]: Linear Optimization and Extensions. Second Edition. Springer, Berlin

    MATH  Google Scholar 

  • Schrijver, A. [1986]: Theory of Linear and Integer Programming. Wiley, Chichester

    MATH  Google Scholar 

Riferimenti citati

  • Avis, D., Chvátal, V. [1978]: Notes on Bland’s pivoting rule. Mathematical Programming Study 8, 24–34

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  • Hoffman, A.J., Kruskal, J.B. [1956]: Integral boundary points of convex polyhedra. In: Linear Inequalities and Related Systems; Annals of Mathematical Study 38 (H.W. Kuhn, A.W. Tucker, eds.), Princeton University Press, Princeton, pp. 223–246

    Google Scholar 

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

    Google Scholar 

  • Klee, V., Minty, G.J. [1972]: How good is the simplex algorithm? In: Inequalities III (O. Shisha, ed.), Academic Press, New York, pp. 159–175

    Google Scholar 

  • Kuhn, H.W. [1956]: Solvability and consistency for linear equations and inequalities. The American Mathematical Monthly 63, 217–232

    Article  MathSciNet  MATH  Google Scholar 

  • Minkowski, H. [1896]: Geometrie der Zahlen. Teubner, Leipzig

    Google Scholar 

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

    Google Scholar 

  • von Neumann, J. [1947]: Discussion of a maximum problem. Working paper. Published in: John von Neumann, Collected Works; Vol. VI (A.H. Taub, ed.), Pergamon Press, Oxford, pp. 27–28

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  • Weyl, H. [1935]: Elementare Theorie der konvexen Polyeder. Commentarii Mathematici Helvetici 7, 290–306

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute for Discrete Mathematics, University of Bonn, Germany

    Bernhard Korte & Jens Vygen

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

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Italia

About this chapter

Cite this chapter

Korte, B., Vygen, J. (2011). Programmazione lineare. In: Ottimizzazione Combinatoria. UNITEXT(). Springer, Milano. https://doi.org/10.1007/978-88-470-1523-4_3

Download citation

Publish with us

Policies and ethics

Search

Navigation