From the below-mentioned graph of shaded feasible region of a linear programming problem (LPP) with objective function \(z = 1.50x + 1.00y\), the maximum value of \(z\) will be:

Answer & explanation
Correct answer: option 2
The correct answer is Option (2) → 52.5
By the corner point method, the maximum of z over a bounded feasible region occurs at a corner. The corners of the shaded region are O(0, 0), A(0, 40), B(15, 30), C(20, 20) and D(20, 0):
\(z(O) = 0\)
\(z(A) = 1.5(0) + 1(40) = 40\)
\(z(B) = 1.5(15) + 1(30) = 52.5\)
\(z(C) = 1.5(20) + 1(20) = 50\)
\(z(D) = 1.5(20) + 1(0) = 30\)
The largest value is 52.5, at B(15, 30).