Maximize (x + y)
Subject to
x - y ≥ 1
x + y ≥ 2
x, y ≥ 0
Subject to
x - y ≥ 1
x + y ≥ 2
x, y ≥ 0
The feasible region is as follows
In this case, you can see we can move as much as we want the objective function in the growing sense of x and y coordinates without leaving the feasible region
Therefore, objective function can grow too into feasible region, so we are in an unbounded solution case for this problem.
