Practice set
Infeasible and Unbounded Cases
Practice distinguishing the terminal outcomes of a linear program. Each case is paired with the feature that makes it hard: an unbounded feasible set that still has a finite optimum, and constraints that are satisfiable in pairs but not all at once.
What this involves
What support you use is recorded alongside your answers.
Answers here count towards what the system knows about your skills.
What this covers
- Classify the feasible region of a linear program
Given a small linear program in two variables, the learner can determine whether its feasible region is empty, bounded, or unbounded, and justify the classification from the constraints rather than from the objective function.