For an objective function 𝑍 = 𝑎𝑥 + 𝑏𝑦, where 𝑎, 𝑏 > 0; the corner points of the feasible region determined by a set of constraints (linear inequalities) are (0, 20), (10, 10), (30, 30) and (0, 40). The condition on a and b such that the maximum Z occurs at both the points (30, 30) and (0, 40) is:
(a) 𝑏 − 3𝑎 = 0 (b) 𝑎 = 3𝑏
(c) 𝑎 + 2𝑏 = 0 (d) 2𝑎 − 𝑏 = 0
This question is inspired from Ex 12.2, 11 (MCQ) - Chapter 12 Class 12 - Linear Programming