Maximise subject to
It is given that:
And it is also subject to constraints that is given below:
We have to maximize Z, we are subject to the constraints above.
We need to convert the inequalities into equation to get the following equation:
The region that represents is explained below:
The line meets the coordinate axes (8,0) and (0,2) respectively. We will join these points to obtain the line . It is clear that (0,0) satisfies the inequation . So, the region containing the origin represents the solution set of the inequation
The region that represents :
The line that is then meets the coordinate axes respectively to get the answer. When we join the points we obtain the line . It is clear that (0,0) satisfies the inequation . So, the region containing the origin represents the solution set of the inequation.
The region that represents :
The line meets the coordinate axes that is meets (3,0) and (0,9) respectively. After joining the lines, we get and then it is clear that (0,0) satisfies the inequation. The region that contains the origin is represented by the solution set of .
The graph for the same is given below and also the final answer: