Home
Class 12
MATHS
The graph of linear programming problem ...

The graph of linear programming problem is given below.The shaded region is the feasible region.The objective function is Maximise, `Z =px+qy`
` If the Max,Z occurs at A and B,what is the relation between pand q?

Promotional Banner

Topper's Solved these Questions

  • LINEAR PROGRAMMING

    BODY BOOKS PUBLICATION|Exercise EXERCISE|2 Videos

  • INVERSE TRIGONOMETRIC FUNCTIONS

    BODY BOOKS PUBLICATION|Exercise EXERCISE|97 Videos

  • MATRICES

    BODY BOOKS PUBLICATION|Exercise EXERCISE|107 Videos

Similar Questions

Explore conceptually related problems

The graph of linear programing problem is given below.The shaded region is the feasible region.The objective function is Z=3x+2y Find the Max Z.

The graph of linear programing problem is given below.The shaded region is the feasible region.The objective function is Z=px+qy Write the constraints.

The graph of linear programming problem is given below.The shaded region is the feasible region.The objective function is Maximise, Z =px+qy If q=1, write the objective function when maximum of Z occures at A and B.

The graph of linear programing problem is given below.The shaded region is the feasible region.The objective function is Z=px+qy What are the co ordinates of the corners of the feasible region.

Consider the linear programming problem: Minimise Z=-3x+4y Subject to x+2yle8 , 3x+2yle12 ,x,y >.0 Mark its feasible region.

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

Consider the linear programming problem, Maximise, Z=x+y , 2x+y-3le0 , x-2y+1le0 , yle3 , xge0 , yge0 Draw its feasible region.

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: Minimise Z=-3x+4y Subject to x+2yle8 , 3x+2yle12 ,x,y ge 0 Find the corner points of the feasible region.

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.