lec2.dviPolyhedral Computation 2010/10/8 Lecture 2 Professor: David Avis Scribe:Shohei Nishida 1 Vertex Enumeration Problem Given an m × n matrix A = (aij) and an m dimensional vector b, a convex polyhedron, or simply polyhedron, P is defined as: P = {x∈Rn : b + Ax≥0}. It is possible that P = ∅ or P could be unbounded e.g. P = {x∈R1 : x≥0}. A polytope is a bounded polyhedron. In this class we will often d
