If the corner points of a 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
For a bounded feasible region, the maximum of z occurs at a corner point. Values of z = 2x + y at the corners:
\(z(O) = 0 + 0 = 0\)
\(z(A) = 2(30) + 0 = 60\)
\(z(B) = 2(20) + 30 = 70\)
\(z(C) = 0 + 50 = 50\)
The largest value, 70, is at B(20, 30), so the optimal value is at B.