Solve the following Linear Programming Problem graphically:
Maximize: ,
Subject to the constraints: , .
Confirming your payment
Previous Year Questions · Question 20 of 37
Solve the following Linear Programming Problem graphically:
Maximize: ,
Subject to the constraints: , .
Sol. The feasible region determined by the constraints, . is given below.

Here, it can be seen that the feasible region is unbounded. The values of at corner points and are given below.
| Corner point | Corresponding value of
| | :--- | :--- | | | 1 ( may or may not be the
maximum value) | | | -2 | | | -6 |
Since the feasible region is unbounded, may or may not be the maximum value. Now, we draw the graph of the inequality, , and we check whether the resulting open half-plane has any point/s, in common with the feasible region or not. Here, the resulting open half plane has points in common with the feasible region. Hence, is not the maximum value. We conclude, has no maximum value.