Home
Class 12
MATHS
Consider the LPP Maximise z=3x+2y Su...

Consider the LPP
Maximise `z=3x+2y`
Subject to the constraints
`x+2yle10`,3x+y`le`15`,`x,y`ge`0`
Find the maximum value of Z.

Promotional Banner

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

Maximise Z=2x+3y subject to the constraints x+y 0 , y>0

Consider the LPP Maximise z=3x+2y Subject to the constraints x+2yle10 ,3x+y le 15 , 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 maximum value of Z.

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

Consider the following L.P.P.Maximize Z=3x+2y subject to the constraints x+2yle10 , 3x+yle15 , x,yge0 .a.Draw its feasible region.

Maximise z=-x+2 y subject to the constraints: x ge 3, x+y ge 5, x+2 y ge 6, y ge 0

Consider the linear programming problem: Minimise Z=3x+9y subject to the constraints: x+3yle60, x+yge10 , xley , xge0 , yge0 . Find the minimum value of Z subject to the given constraints.

Minimise Z=3 x+2 y ,subject to the constraints: x+y ge 8 , 3 x+5 y le 15 , x ge 0, y ge 0

Solve graphically. Maximise Z=5x+3y Subject to the constraints 3x+5yle15 , 5x+2yle10 , xge0 , yge0

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.

V PUBLICATION-LINEAR PROGRAMMING-QUESTION BANK
  1. Maximise Z=5 x+3 y Subject to 3 x+5 y le 15,5 x+2 y le 10, x ge 0, y g...

    Text Solution

    |

  2. Minimise Z=3 x+5 y such that x+3 y ge 3, x+y ge 2, x, y ge 0

    Text Solution

    |

  3. Consider the LPP Maximise z=3x+2y Subject to the constraints x+2...

    Text Solution

    |

  4. Solve the following linear programming problems graphically Minimize...

    Text Solution

    |

  5. Show that the maximum of Z occurs at more than two points. Minimise ...

    Text Solution

    |

  6. Minimize and maximize z = x + 2y subject to x + 2y ge 100, 2x - y le 0...

    Text Solution

    |

  7. Maximise z=-x+2 y subject to the constraints: x ge 3, x+y ge 5, x+2 y...

    Text Solution

    |

  8. Maximise z = x + y, subject to x - y le -1 , -x + y le 0, x , y ge 0.

    Text Solution

    |

  9. A manufacture company makes two models A and B of a product. Each piec...

    Text Solution

    |

  10. One kind of cake requires 200g of flour and 25g of fat ,and another ki...

    Text Solution

    |

  11. A factory makes tennis rackets and bats,A tennis racket takes 1.5 hour...

    Text Solution

    |

  12. A manufacturur produces nuts and bolts.It takes 1 hour of work on mach...

    Text Solution

    |

  13. A factory manufactures two types of screws, A and B. Each type of scre...

    Text Solution

    |

  14. A cottage industry manufactures pedestal lamps and wooden shades, each...

    Text Solution

    |

  15. A company manufactures two types of rovelty souvenirs made of plywood....

    Text Solution

    |

  16. A merchant plans to sell twó types of personal computers - a desktop m...

    Text Solution

    |

  17. A diet is to contain atleast 80 units of vitamin A and 100 units of mi...

    Text Solution

    |

  18. The corner points of the feasible region determined by the following s...

    Text Solution

    |

  19. (Manufacturing problem) A manufacturer has three machines I , II and I...

    Text Solution

    |

  20. How many packets of each food should be used to maximise the amount of...

    Text Solution

    |