Homepage › Solution manuals › Dimitris Bertsimas › Introduction to Linear Optimization › Exercise 2.1
Exercise 2.1
For each one of the following sets, determine whether it is a polyhedron.
(a) The set of all
satisfying the constraints
(b) The set of all
satisfying the constraint .
(c) The empty set.
Answers
By Definition 2.1, we must represent the sets in question as
for some matrix and a vector .
- (a)
- No. To see why, notice that the set
defined by the constraints in question is, in fact, equal to
and the latter is obviously not a polyhedron.
-
Let . In case that , we obviously have . Assume that . Then, there exists a such that
But then from we deduce that . In other words, , i.e., .
-
Take any and . Then,
In other words, , i.e., .
We have thus established that . But is not a polyhedron (see this answer on why a ball is not a polyhedron). Thus, is not a polyhedron as well.
Figure 1: Figure defined by and . -
- (b)
- Yes. Using the standard procedure to find the zeros
of a quadratic equation, we can equivalently rewrite
as
, which is equivalent
to saying that both
and
must hold. In other words,
- (c)
- Yes. Empty set can be represented as a solution to any unsolvable
system of linear equations. For instance, if we demand both
and
,
then the polyhedron inequality
characterizes a polyhedron and the empty set.
Comments
(a) Consider the polar coordinate system. Let , , . Then and . Since the inequality must hold for all , we have . Therefore, the set actually is a quarter of a unit circle and hence is not a polyhedron.
(b) We can equivalently write
Thus, the set is a polyhedron of the form .
(c) Empty set is a polyhedron. An example is .