Convex Analysis

Robert J. Vanderbei
Additional contact information
Robert J. Vanderbei: Princeton University

Chapter Chapter 10 in Linear Programming, 2014, pp 141-150 from Springer

Abstract: 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.

Keywords: Line Segment; Feasible Solution; Convex Hull; Linear Programming Problem; Convex Combination (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-1-4614-7630-6_10

Ordering information: This item can be ordered from
http://www.springer.com/9781461476306

DOI: 10.1007/978-1-4614-7630-6_10

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().