ExamBro
ExamBro
CUET · MATHS · PYQ PAPER 2025

The corner points of the bounded feasible region for a linear programming problem (LPP) are \(\left(0, \frac{3}{2}\right),(1,2)\) and \((4,0)\).
If the objective function is \(Z=a x+b y\), where \(a\) and \(b\) are positive,
then the condition on \(a\) and \(b\) so that the maximum of \(Z\) occurs at \((1,2)\) and \((4,0)\) is :

  1. A \(a=2 b\)
  2. B \(2 a=b\)
  3. C \(3 a=2 b\)
  4. D \(3 a=4 b\)
Verified Solution

Answer & Solution

Correct Answer

(C) \(3 a=2 b\)

Step-by-step Solution

Detailed explanation

\(Z(1,2) = a(1) + b(2) = a+2b\) \(Z(4,0) = a(4) + b(0) = 4a\) \(Z(1,2) = Z(4,0) \implies a+2b = 4a\) \(2b = 3a\)
Same subject
Explore more questions on app