Homepage › Solution manuals › Dimitris Bertsimas › Introduction to Linear Optimization › Exercise 2.7
Exercise 2.7
Supponse that and are two representations of the same nonempty polyhedron. Suppose that the vectors span . Show that the same must be true for the vectors .
Answers
Proof. Since is nonempty, it possesses at least one basic feasible solution (Theorem 2.6). Since , there are linearly independent constraints in that are active at (Definition 2.9). By Theorem 2.2., the span of vectors is all of . □
Comments
-
A polyhedron may not have a basic feasible solution (Look at Exercise 4.44b).subhams • 2024-10-20
Assume otherwise the vector do not span Then, they are all in a proper subspace of . Hence, there exists a non-zero vector such that . Let be an element of the polyhedron represented by and . Consider the line . Note that . Thus, the line is contained in the polyhedron. Hence, we have . Clearly, must be orthogonal to all the vectors ’s. However, the vectors span , and hence Contradiction. We conclude that the vector also