Skip to main contentSkip to solution

The corner points of the bounded feasible region for an LPP are: (5, 5), (15, 15), (0, 20) and (0, 10). Let z=3x+9yz = 3x + 9y be the objective function. Then the value of maximum(z)−minimum(z)maximum(z) - minimum(z) is

Solution

✅ Correct Option: 3

The corner points of the bounded feasible region are: (5,5)(5, 5), (15,15)(15, 15), (0,20)(0, 20), and (0,10)(0, 10).

The objective function is z=3x+9yz = 3x + 9y.

In Linear Programming, the maximum and minimum values of the objective function occur at the corner points of the feasible region.


At point (5,5)(5, 5):

z=3(5)+9(5)z = 3(5) + 9(5)

z=15+45z = 15 + 45

z=60z = 60


At point (15,15)(15, 15):

z=3(15)+9(15)z = 3(15) + 9(15)

z=45+135z = 45 + 135

z=180z = 180


At point (0,20)(0, 20):

z=3(0)+9(20)z = 3(0) + 9(20)

z=0+180z = 0 + 180

z=180z = 180


At point (0,10)(0, 10):

z=3(0)+9(10)z = 3(0) + 9(10)

z=0+90z = 0 + 90

z=90z = 90


The values of zz are: 60,180,180,9060, 180, 180, 90

Maximum value of z=180z = 180

Minimum value of z=60z = 60


maximum(z)−minimum(z)=180−60\text{maximum}(z) - \text{minimum}(z) = 180 - 60

=120= 120

Therefore, the value of maximum(z)−minimum(z)=120\text{maximum}(z) - \text{minimum}(z) = 120

Keyboard Shortcuts

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