Home
Class 12
MATHS
For an LPP, minimise Z = 2x + y subject ...

For an LPP, minimise Z = 2x + y subject to constraint `5x+10y le 50 , x +y ge 1,y le 4 ` and ` x,y ge 0 ` then Z is equal to

A

0

B

1

C

2

D

12

Text Solution

Verified by Experts

The correct Answer is:
B
The Feasible region is ABCDEA ,hwose corner points are `A(0,1)B(1,0 ),C(10,0),D(2,4) and E (0,4).`
Now , table for object function z=2x +y is given is :
` (##ARH_EGN_PRG_MAT_C17_E02_006_S01.png" width="80%">
Hence, minimum vlaue of Z is 1 at A(0,1) .
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

Minimize Z = 2x + 3y subject to constraints x + y ge 6 , 2x + y ge 7, x + 4y ge 8 , x ge 0 , y ge 0

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 .

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

Maximize Z = 400x + 500y subject to constraints x + 2y le 80 ,2x + y le 90, 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 .

Maximize Z = 5x + 3y subject to the constraints: 3x + 5y le 15, 5x + 2y le 10, 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

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

Maximum value of Z = 12x + 3y subject to constraints x ge 0,y ge 0, x+y le 5 and 3x+y le 9 is

MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS-Linear Programming -EXERCISE 2 (MISCELLANEOUS PROBLEMS )
  1. The solution set of the linear inequalities 2x + 2y ge 10 and x+ 2y ...

    Text Solution

    |

  2. Solve the linear programming problem. Maximise Z = x + 2y Subject ...

    Text Solution

    |

  3. For an LPP, minimise Z = 2x + y subject to constraint 5x+10y le 50 , x...

    Text Solution

    |

  4. Consider the inequalities x1+x2 le 3,2x1+5x2ge 10x1,x2 ge 0 then feas...

    Text Solution

    |

  5. Z=4x+2y,4x+2y ge 46, x +3y le 24 and x and y are greater than or equ...

    Text Solution

    |

  6. The minimum vlaue Z = 2x1 +3x2 subject to the conditions 2x1+7x2ge22...

    Text Solution

    |

  7. The maximum value P = 3x + 4y subjected to the constraints x + y le 40...

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

  19. Shaded region is represented by , the constraints

    Text Solution

    |

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

    Text Solution

    |