Characterization of Unboundedness in Linear Programming
A common pitfall is confusing an unbounded feasible region with an unbounded objective function. The feasible region can be unbounded without the objective function being unbounded, for instance, if the objective function decreases along all unbounded directions.
Institutional Reference: Linear and Integer Programming
View Full Proof →