Algebra > Linear Programming
Medium
core
The corner points of the bounded feasible region determined by a set of constraints in an LPP are $P(0, 5)$, $Q(3, 5)$, $R(5, 0)$ and $S(4, 1)$. If the objective function is $z = ax + 2by$, where, $a, b > 0$, then the condition on $a$ and $b$ such that the maximum value of $z$ occurs at $Q$ and $S$ is
✅ Correct Option: 4
Related questions:
2025: 19 May Shift 1
2025: 3 June Shift 1
2025: 30 May Shift 1