If the corner points of Linear Programming Problem having objective function Max $z= 2x+y $ are $O(0,0), A(30, 0), B(20, 30), C(0, 50),$ then the optimal value will be at the point :
Answer & explanation
Correct answer: option 3
The correct answer is Option (3) → B
| Corner Points | $Z=2x+y$ |
| $O(0,0)$ | $Z_O=0$ |
| $A(30,0)$ | $Z_A=60$ |
| $B(20,30)$ | $Z_B=40+30=70$ |
| $C(0,50)$ | $Z_C=50$ |
(Maximum value exists at point B)