Question

Medal and fan.
Which term best describes the linear programming situation represented by the graph? infeasible, unbounded, an optional solution, or alternate optimal solutions?

Answer 1

notice that the feasible region, shaded gray, is not bounded -- hence this is an *unbounded* problem. an infeasible problem would instead have NO shaded region, as the constraints would be inconsistent, and alternate optimal solutions occur where you end up with two adjacent solutions with the same maximum or minimum value for the objective function