Advertisements
Advertisements
Question
The corner points of the feasible region for a Linear Programming problem are P(0, 5), Q(1, 5), R(4, 2) and S(12, 0). The minimum value of the objective function Z = 2x + 5y is at the point ______.
Options
P
Q
R
S
MCQ
Solution
The corner points of the feasible region for a Linear Programming problem are P(0, 5), Q(1, 5), R(4, 2) and S(12, 0). The minimum value of the objective function Z = 2x + 5y is at the point R.
Explanation:
Corner Points | Value of Z = 2x + 5y |
P(0, 5) | Z = 2(0) + 5(5) = 25 |
Q(1, 5) | Z = 2(1) + 5(5) = 27 |
R(4, 2) | Z = 2(4) + 5(2) = 18 Minimum |
S(12, 0) | Z = 2(12) + 5(0) = 24 |
Thus, minimum value of Z occurs at R(4, 2).
shaalaa.com
Is there an error in this question or solution?