Skip to main content

Convex Analysis

  • Chapter
Linear Programming

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 37))

  • 2352 Accesses

Abstract

This book is mostly about linear programming. However, this subject, important as it is, is just a subset of a larger subject called convex analysis. In this chapter, we shall give a brief introduction to this broader subject. In particular, we shall prove a few of the fundamental results of convex analysis and see that their proofs depend on some of the theory of linear programming that we have already developed.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

  • Carathéodory, C. (1907), `Ãœber den Variabilitätsbereich der Koeffizienten von Potenzreihen, die gegebene Werte nicht annehmen’, Mathematische Annalen 64, 95–115. 171

    Google Scholar 

  • Farkas, J. (1902), Theorie der einfachen Ungleichungen’, Journal für die reine und angewandte Mathematik 124, 1–27. 171

    Google Scholar 

  • Gordan, P. (1873), `Ãœber die Auflösung linearer Gleichungen mit reelen Coefficienten’, Mathematische Annalen 6, 23–28. 171

    Google Scholar 

  • Stiemke, E. (1915), `Ãœber positive Lösungen homogener linearer Gleichungen’, Mathematische Annalen 76, 340–342. 171

    Google Scholar 

  • Ville, J. (1938), Sur la théorie général des jeux ou intervient l’habileté des jouers, in E. Borel, ed., `Traité du Calcul des Probabilités et des ses Applications’, Paris, Gauthiers-Villars. 171

    Google Scholar 

  • Tucker, A. (1956), `Dual systems of homogeneous linear equations’, Annals of Mathematics Studies 38, 3–18. 171, 368

    Google Scholar 

  • Rockafellar, R. (1970), Convex Analysis, Princeton University Press, Princeton, NJ.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Robert J. Vanderbei

About this chapter

Cite this chapter

Vanderbei, R.J. (2001). Convex Analysis. In: Linear Programming. International Series in Operations Research & Management Science, vol 37. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-5662-3_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-5662-3_10

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4757-5664-7

  • Online ISBN: 978-1-4757-5662-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics