Convex Polyhedra

Part of the Graduate Texts in Mathematics book series (GTM, volume 258)


In this chapter, we develop the basic results of the theory of convex polyhedra. This is a large area of research that has been studied from many different points of view. Within optimization, it is very important in linear programming, especially in connection with the simplex method for solving linear programs. The choice of the topics we treat in this chapter is dictated mostly by the needs of optimization. However, we do not have space to treat the extensive body of work concerning the combinatorial theory of convex polyhedra, some of which is intimately related to the simplex method and its variants. The interested reader may consult the books [115, 50, 274] for more information on this topic and the book [5] for differential-geometric questions regarding convex polyhedra.


Variational Inequality Linear Inequality Convex Polyhedron Polyhedral Cone Polar Cone 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer New York 2010

Authors and Affiliations

  1. 1.Department of Mathematics & StatisticsUniversity of MarylandBaltimoreUSA

Personalised recommendations