To determine the feasible region represented by the constraints, we follow these steps:
Plotting the Constraints:
The constraints are:
\[4x + y \geq 80\]
\[x + 5y \geq 115\]
\[3x + 2y \leq 150\]
\[x, y \geq 0 \text{ (indicating the feasible region is in the first quadrant)}\]
Each constraint represents a line in the \( xy \)-plane.
Identifying the Feasible Region:
The region satisfying all the constraints is the shaded region bounded by the intersection of the lines.
Based on the plot provided, Region C is enclosed by these lines and represents the feasible solution set for the linear programming problem (LPP).
Verification:
Region C satisfies all the constraints, including the inequality \( 3x + 2y \leq 150 \), which bounds it from above.
Other regions do not satisfy all the constraints simultaneously.
Thus, the feasible region for the given LPP is represented by Region C.
List-I | List-II | ||
A | If the corner points of the feasible region For an LPP are (0, 4), (5, 0), (7, 9), then the minimum value of the objective function Z =5x+y is. | I | 27 |
B | If the corner points of the feasible region for an LPP are (0, 0), (0, 2), (3, 4), (5, 3). then the maximum value of the objective function Z=3x+4y | II | 60 |
C | The comer points of the feasible region for an LPP are (0, 2), (1, 2), (4,3), (7, 0). The objective function is Z = x+5y. Then (Max Z+Min Z) is | III | 25 |
D | If the corner points of the feasible region for an LPP are (0, 4), (3, 0), (3, 2), (6,9) The objective function is Z=2x+6y. Then (Max Z-Min Z) | IV | 26 |