Linear programming

The feasible region

Every constraint keeps one side of a line; what survives is convex, closed, and sometimes empty or unbounded.

About 25 minutes7 activities Paper packet