Home
Class 12
MATHS
Consider the linear programming problem:...

Consider the linear programming problem:
Maximize `z=4x+y`
Subject to constraints:
`x+yle50`,`3x+yle90`,`x,yge0`
Draw the feasible region.

Answer

Step by step text solution for Consider the linear programming problem: Maximize z=4x+y Subject to constraints: x+yle50,3x+yle90,x,yge0 Draw the feasible region. by MATHS experts to help you in doubts & scoring excellent marks in Class 12 exams.

Doubtnut Promotions Banner Mobile Dark
|

Topper's Solved these Questions

  • INVERSE TRIGONOMETRIC FUNCTIONS

    V PUBLICATION|Exercise QUESTION BANK|80 Videos
  • MATRICES

    V PUBLICATION|Exercise QUESTION BANK|100 Videos

Similar Questions

Explore conceptually related problems

Consider the linear programming problem: Maximum z=50x+40y subject to constraints: x+2yle10 , 3x+4yge24 , x,yge0 Draw the feasible region.

Consider the linear programming problem: Maximize z=4x+y Subject to constrains: x+yle50 , 3x+yle90 , x,yge0 Find the corner at which 'z' attains its maximum value.

Consider the linear programming problem: Minimise Z=3x+9y subject to the constraints: x+3yle60 x+yge10 , xley , xge0 , yge0 . Draw its feasible region.

Consider the linear programming problem: Maximum z=50x+40y subject to constraints: x+2yle10 , 3x+4yge24 , x,yge0 Find the maximum value of z.

Solve the linear programming problem graphically Maximise Z=3x+5y subject to the constraints x+3yle3 x+yle2 x,yge0

Consider the linear programming problem: Maximize Z=50x+40y Subject to the constraints x+2yge10 3x+4yle24 xge0,yge0 Find the maximum value of Z.

Consider the linear programming problem: Maximize Z=50x+40y Subject to the constraints x+2yge10 3x+4yle24 xge0,yge0 Find the corner points of the feasible region.

Consider the linear programming problem, Maximize, Z=x+y , subject to constraints 2x+y-3le0 , x-2y+1le0 , yle3 , xge0 , yge0 Find the corner points of the feasible region.

Consider the linear programming problem: Maximum z=50x+40y subject to constraints: x+2yle10 , 3x+4yge24 , x,yge0 Find the corner points of the feasible region.

Maximise: Z=600x+400y Subject to the constraints: x+2yle12 , 2x+yle12 4x+5yge20 , xge0 , yge0 Draw the feasible region.