The given constraints are,
The given objective function which needs to maximize is,
The line
x | 0 | 5 |
y | 5 | 0 |
Also, when
This is false, so the graph have the shaded region away the origin.
The line
x | 0 | 6 |
y | 3 | 0 |
Also, when
This is false, so the graph have the shaded region away the origin.
By the substitution method, the intersection points of the lines
Plot the points of all the constraint lines,
It can be observed that the corner points are
Substitute these points in the given objective function to find the maximum value of Z.
Corner points | |
| -6 |
| -2 |
| 1 (Maximum) |
Since the feasible region is unbounded, so, 1 may or may not be the maximum value of Z.
Plot the graph of inequality
It can be observed that feasible region has common points with the equation of inequality, so
Therefore,