CUET Preparation Today
CUET
-- Mathematics - Section A
Linear Programming
The corner points of the feasible region of a LPP 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 :
P
Q
R
S
The correct answer is Option (3) → R
Minimum value at point R