Exercise 2.7

Supponse that {x naix bi,i = 1,,m} and {x ngix hi,i = 1,,k} are two representations of the same nonempty polyhedron. Suppose that the vectors a1,,am span n. Show that the same must be true for the vectors g1,,gk.

Answers

Proof. Since {x naix bi,i = 1,,m} is nonempty, it possesses at least one basic feasible solution x (Theorem 2.6). Since x{x ngix hi,i = 1,,k}, there are n linearly independent constraints in {gigix = hi} that are active at x (Definition 2.9). By Theorem 2.2., the span of vectors {gii = 1,,k} is all of n. □

User profile picture
2021-11-20 16:04
Comments
  • A polyhedron may not have a basic feasible solution (Look at Exercise 4.44b).
    subhams2024-10-20

Assume otherwise the vector g1,,gk do not span n. Then, they are all in a proper subspace of n. Hence, there exists a non-zero vector d n such that dgi = 0i = 1,,k. Let x0 be an element of the polyhedron represented by {x ngix hi,i = 1,,k} and {x naix bi,i = 1,,m}. Consider the line x0 + λd,λ . Note that gi (x0 + λd) = gix0 hii = 1,,k. Thus, the line is contained in the polyhedron. Hence, we have ai(x + λd) bi,λ i = 1,,m. Clearly, d must be orthogonal to all the vectors ai ’s. However, the vectors a1,,am span n, and hence d = 0. Contradiction. We conclude that the vector g1,,gk also span n.

User profile picture
2019-03-05 00:00
Comments