Convex Programming Based on Hahn-Banach Theorem | Chapter 05 | Theory and Applications of Mathematical Science Vol. 1

The main objective of this chapter is to present the separation theorems, important consequences of Hahn-Theorem theorem. Therefore, we begin with an overview on convex sets and convex functionals. Then go on with the Hahn-Banach theorem and separation theorems. Follow these results specification: first for normed spaces and then for a subclass of these spaces, the Hilbert spaces. In this last case plays a key role the Riesz representation theorem. Separation theorems are key results in convex programming. Then the chapter ends with the outline of applications of these results in convex programming, Kuhn-Tucker theorem, and in minimax theorem, two important tools in operations research, management and economics, for instance.

Author(s) Details

Manuel Alberto M. Ferreira
ISTAR-IUL – Information Sciences, Technologies and Architecture Research Center (ISTA), Portugal.

View Books: http://bp.bookpi.org/index.php/bpi/catalog/book/117

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s