Detecting and Proving Infeasibility in Linear Programs
Students often confuse 'infeasibility' with 'unboundedness'. Infeasibility means the feasible region is the empty set, whereas unboundedness implies the feasible region exists but extends to infinity, allowing the objective function to improve without limit.
Institutional Reference: Linear and Integer Programming
View Full Proof →