9.6. Cones III#

9.6.1. Polyhedral Cones#

Definition 9.37 (Polyhedral cone)

The conic hull of a finite set of points is known as a polyhedral cone.

In other words, let {x1,x2,,xm} be a finite set of points. Then

C=cone{x1,x2,,xm}

is known as a polyhedral cone.

Theorem 9.65

A polyhedral cone is nonempty, closed and convex.

Proof. Since it is the conic hull of a nonempty set, hence it is nonempty and convex.

Theorem 9.131 shows that the conic hulls of a finite set of points are closed.

Remark 9.7 (Polyhedral cone alternative formulations)

Following are some alternative definitions of a polyhedral cone.

  1. A cone is polyhedral if it is the intersection of a finite number of half spaces which have 0 on their boundary.

  2. A cone C is polyhedral if there is some matrix A such that C={xRn|Ax0}.

  3. A cone is polyhedral if it is the solution set of a system of homogeneous linear inequalities.

9.6.1.1. Polar Cones#

Theorem 9.66 (Polar cone of a polyhedral cone)

Let the ambient space by Rn. Let ARm×n. Let

C={xRn|Ax0}.

Then

C={ATt|tR+m}.

We note that the set C is a convex cone. It is known as the convex polyhedral cone.

Proof. We note that yC if and only if xTy0 for every x satisfying Ax0.

  1. Thus, for every xRn, the statement Ax0xTy0 is true.

  2. By Farkas’ lemma (Theorem 10.55), it is equivalent to the statement that there exists t0 such that ATt=y.

  3. Thus,

    C={ATt|tR+m}.