Home
Class 12
MATHS
The minimum and maximum values problem, ...

The minimum and maximum values problem, of Z for the minimise and maximise Z = 3x + 9 y subject to the constraints
`x+3y le 60,x + y ge 10 , x le y,`
are respectively

A

60 and 180

B

180 and 60

C

50 and 190

D

190 and 50

Text Solution

Verified by Experts

The correct Answer is:
A

Given Z= 3x+9y
Subject to the constraints
` x +3y le 60`
` x+y ge 10 `
` x le y`
and ` x ge 0, y ge 0`
The feasible region is ABCD whose corner points A,B,C and D are (0,15),(5,5),(15,5) and (0,20) respectively .

Form the table, the minimum value of Z is 60 and the maximum value of Z is 180.
Promotional Banner

Topper's Solved these Questions

  • Linear Programming

    MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS|Exercise MHT CET Corner|13 Videos
  • Linear Programming

    MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS|Exercise EXERCISE 1 (TOPICAL PROBLEMS )(Solution of LPP Graphical Method )|15 Videos
  • LINE

    MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS|Exercise MHT CET Corner|3 Videos
  • MATHEMATICAL LOGIC

    MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS|Exercise MHT CET CORNER|22 Videos

Similar Questions

Explore conceptually related problems

Maximise Z=3x+4y, Subjected to the constraints x+y le1, x ge 0, y ge 0

Maximize : Z = x + y ,subject to the constraints: x - y le -1, -x + y le 0, x ge 0, y ge 0

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

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

The maximum value of Z = 4x + 2y subject to the constraints 2x+3y le 18,x+y ge 10, x , y ge 0 is

Maximize z = 5x + 10y subject to constraints x + 2y le 10 , 3x + y le 12 , x ge 0 , y ge 0

Maximize z =2x + 3y subject to constraints x + 4y le 8, 3x + 2y le 14 , x ge 0, y ge 0 .

Maximize z= 7x+11y subject to the constraints 3x+5y le 26,5x+3y le 30 , x ge 0, y ge 0

Minimize Z = -3x + 4y subject ot constraints : x + 2y le 8, 3x + 2y le 12, x ge 0, y ge 0 .

Find maximum value of z=2x+3y subject to the constraints x+y le 4 , x ge 0 , y ge 0 .

MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS-Linear Programming -EXERCISE 2 (MISCELLANEOUS PROBLEMS )
  1. The maximum value P = 3x + 4y subjected to the constraints x + y le 40...

    Text Solution

    |

  2. Consider the inequalities 5x1+4x2ge9,x1+x2 le 3, x1 ge 0 , x2 ge 0 Wh...

    Text Solution

    |

  3. The minimum and maximum values problem, of Z for the minimise and ma...

    Text Solution

    |

  4. The linear programming problem minimiseZ=3x+2y subject to the constrai...

    Text Solution

    |

  5. The maximum and minimum values of the objective function Z = x + 2y s...

    Text Solution

    |

  6. The maximum value of the objective function Z=3x+4y subject to th...

    Text Solution

    |

  7. Let x and y are the number of tables and chairs respectively, on which...

    Text Solution

    |

  8. The graphical solution of linear inequalities x+y ge 5 " and " x -y ...

    Text Solution

    |

  9. By graphical method, the solutions of linear programming problem maxim...

    Text Solution

    |

  10. A toy company manufactures two types of doll; a basic version doll; a ...

    Text Solution

    |

  11. The minimum value of Z = 10x + By subject to 4x +y ge 4, x +3y ge 6, ...

    Text Solution

    |

  12. The point which provides the solution of the solution to the linear pr...

    Text Solution

    |

  13. Shaded region is represented by , the constraints

    Text Solution

    |

  14. Let R be the feasible region (convex polygon) for a linear programming...

    Text Solution

    |

  15. The minimum value of the objective function Z=x+2y Subject to the c...

    Text Solution

    |

  16. Let the feasible region of the linear programming problem with the obj...

    Text Solution

    |

  17. The minimum and maximum values of the objective function, Z = 5x + 1...

    Text Solution

    |

  18. Consider the following statements I. If the feasible region of an L...

    Text Solution

    |

  19. The corner points of the feasible region determined by the system of l...

    Text Solution

    |

  20. (Allocation problem) A cooperative society of farmers has 50 hectar...

    Text Solution

    |