Skip to main contentSkip to solution

The corner points of the bounded feasible region for a linear programming problem (LPP) are (0, 3/2), (1, 2) and (4, 0). If the objective function is Z = ax + by, 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:

Solution

Correct Option: 3

For the maximum of Z to occur at both points (1, 2) and (4, 0) simultaneously, both points must give the same maximum value.


The value of Z at each corner point:

At (0, 3/2): Z=a(0)+b(32)=3b2Z = a(0) + b(\frac{3}{2}) = \frac{3b}{2}

At (1, 2): Z=a(1)+b(2)=a+2bZ = a(1) + b(2) = a + 2b

At (4, 0): Z=a(4)+b(0)=4aZ = a(4) + b(0) = 4a


For maximum to occur at both (1, 2) and (4, 0), these two points must have equal Z values:

a+2b=4aa + 2b = 4a

2b=3a2b = 3a

3a=2b3a = 2b


When 3a=2b3a = 2b, the value a+2b=4a=3b2+b23b2a + 2b = 4a = \frac{3b}{2} + \frac{b}{2} \geq \frac{3b}{2}

Since a,b>0a, b > 0, this confirms the condition for maximum.

Therefore, the condition is 3a=2b3a = 2b.

Keyboard Shortcuts

  • Left arrow: Previous question
  • Right arrow: Next question
  • S key: Jump to solution
  • Q key: Jump to question