338 ACTIVITY 7: Convex Sets, Hyperplanes, and Various Hulls

WHY:

This activity is designed to help you understand how to recognize a convex set and draw a hyperplane and the linear, affine, conical, and convex hull of a set of points. We will model objective functions in linear programming as hyperplanes, and the feasible region as the intersection of halfspaces which are bounded by hyperplanes. When solving linear programming problems we will make extensive use of the convexity of the feasible region. We will use conical and convex hulls to formulate the finite basis theorem which we use to prove that we have reached an optimal solution.

LEARNING OBJECTIVES:

  1. Gain an understanding of what makes a set convex.
  2. Discover the connection between Hyperplane, Subspace, and the solution space of a system of equations.
  3. Gain an understanding of Linear, Affine, Conical and Convex Hulls.

PERFORMANCE CRITERIA:

  1. Quality of the answers to the Critical Thinking Questions.
  2. Level of understanding of the models in the Maple workspace.

INFORMATION:

Line Segment
The line segment joining two points X1 and X2 is the set (tX1 + (1-t)X2) for 0<=t<=1.

Convex Set
S is convex if for any two distinct points of S the line segment joining these points is contained completely in S.

Hyperplane
The set of points satisfying the equation CTX = k is called a hyperplane. A hyperplane divides space into upper and lower Halfspaces.

Linear Hull
The linear hull L(S) of a set S is the set of all linear combinations of vectors in S. It is the same as the space spanned by the vectors in S.

Affine Hull
The affine hull Aff(S) of a set S is the set of all affine combinations of vectors in S. It is the lowest dimensional hyperplane which passes through all the points of S. (I.e. in R3, if S has one point Aff(S) is the point; if S has two points, Aff(S) is the line determined by them; if S has three noncolinear points, Aff(S) is the plane determined by them; if S contains at least four noncoplanar points, Aff(S) is all of R3.)

Conical Hull
The conical hull Coni(S) of a set S is the set of all conical combinations of vectors in S. Coni(S) is the smallest cone with vertex at the origin containing the points of S.

Convex Hull
The convex hull Conv(S) of a set S is the set of all convex combinations of vectors in S. Conv(S) is the smallest convex set containing the points of S. The convex hull of a finite set of points is called a Convex Polytope.

Convex Polyhedron
A convex polyhedron is the intersection of halfspaces. The feasible region of a linear programming problem is a convex polyhedron. Bounded convex polyhedra are convex polytopes. The direction vectors of an unbounded convex polyhedron are vectors in the direction of its bounding rays. Note that a convex polytope has no direction vectors.

RESOURCES:

  1. Chapter 2, Strategic Mathematics
  2. MAPLE help system
  3. Activity7 workspace
  4. 30 minutes

PLAN:

  1. Choose roles if you have not already done so.
  2. Assess the team's understanding of the terms listed in the information section.
  3. Execute the model in the Activity7 MAPLE workspace by launching MAPLE and then opening Activity7 as Maple text. Have the recorder write down what happened at each step and any discoveries the team made as the model was executed.
  4. Use the model to answer the critical thinking questions.

MODEL:

Get into the MAPLE text Activity7 under Public\Courses\Math\Math338 and execute each line. Here are some general rules about working with Maple workspaces:

CRITICAL THINKING QUESTIONS:

These will be provided in class.


Math 338 Activity 7 -- Revised 9/15/98

Return to the List of Activities