In this chapter, we (a) present the notion of a polyhedral representation and illustrate its importance, (b) demonstrate via Fourier--Motzkin eliminaton that every polyhedrally representable set is polyhedral, and (c) outline the calculus of polyhedral representations. As an immediate application, we demonstrate that a bounded and feasible LP problem is solvable.
Review the options below to login to check your access.
Log in with your Cambridge Aspire website account to check access.
If you believe you should have access to this content, please contact your institutional librarian or consult our FAQ page for further information about accessing our content.