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
A. P
B. Q
C. R
D. S
Answer:C
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
A. P B. Q C. R D. S