Hence, maximise the objective function given by $Z = x + y$.
LPP Feasible Region
Answer
Answer
AI
The corner points of the bounded feasible region are $A(1,1)$, $B(3,3)$, and $C(1,7)$.
Evaluating the objective function $Z = x + y$ at each vertex:
- At $A(1,1)$: $Z = 1 + 1 = 2$
- At $B(3,3)$: $Z = 3 + 3 = 6$
- At $C(1,7)$: $Z = 1 + 7 = 8$
Therefore, the maximum value of $Z$ is $8$, which occurs at $C(1,7)$.
Check your working with the LPP solver (graphical method): linear programming by the graphical method: the feasible region drawn, corner points and the optimum.
