Abstract
We begin the chapter by introducing basic concepts of convex sets and linear functions in a Euclidean space. We review some of fundamental facts about convex polyhedral sets determined by systems of linear equations and inequalities, including Farkas’ theorem of the alternative which is considered a keystone of the theory of mathematical programming.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Luc, D.T. (2016). Convex Polyhedra. In: Multiobjective Linear Programming. Springer, Cham. https://doi.org/10.1007/978-3-319-21091-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-21091-9_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21090-2
Online ISBN: 978-3-319-21091-9
eBook Packages: Business and ManagementBusiness and Management (R0)