Step | Description |
---|---|
1 | Identify the feasible region by graphing the constraints on the xy-plane. |
2 | Graph x+y=10. This is a line passing through the points (0,10) and (10,0). |
3 | Graph 3x+4y=36. This line passes through (0,9) and (12,0). |
4 | Identify the feasible region where all constraints overlap, considering x≥0 and y>0. |
5 | Determine the vertices of the feasible region. They are (0,0), (0,9), (4,6), and (10,0). |
6 | Calculate Z=2x+3y for each vertex:
|
7 | Identify the maximum value: Z=27 at (0,9). |
Assertion (A): The corner points of the bounded feasible region of a L.P.P. are shown below. The maximum value of \( Z = x + 2y \) occurs at infinite points.
Reason (R): The optimal solution of a LPP having bounded feasible region must occur at corner points.