Home
Class 12
MATHS
Solve the LPP: Maximize Z=-3x+4y Subje...

Solve the LPP:
Maximize Z=-3x+4y
Subject to
`x+2yle8`,
`3x+2yle12`,
`xge0,yge0`.

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

Solve the following LPP Graphically, Minimise, Z=-3x+4y Subject to constraints, x+2yle8, 3x+2yle12,xge0,yge0

Consider the LPP Maximise, Z=5x+3y Subject to, 3x+5yle15 , 5x+2yle10 , x,yge0 Draw the feasible region.

Consider the LPP Maximise, Z=5x+3y Subject to, 3x+5yle15 , 5x+2yle10 , x,yge0 Find the corner points of the feasible region.

Consider the LPP Maximise, Z=5x+3y Subject to, 3x+5yle15 , 5x+2yle10 , x,yge0 Find the corner at which Z attains its maximum.

Consider the linear programming problem: Minimise Z=-3x+4y Subject to x+2yle8 , 3x+2yle12 ,x,y ge 0 Find the corner at which Z attain its minimum.

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.

Solve the linear programming problem graphically: Max: z=3x+2y Subject to: x+2yle10,3x+yle15,xge0,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: Minimise Z=-3x+4y Subject to x+2yle8 , 3x+2yle12 ,x,y >.0 Mark its feasible region.