CUET Preparation Today
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 : |
O A B C |
B |
The correct answer is Option (3) → B
(Maximum value exists at point B) |
