Home
Class 12
MATHS
Let x and y are the number of tables and...

Let x and y are the number of tables and chairs respectively, on which a furniture dealer wants to make profit for the constraints Maximise Z = 250x + 75 y
`5x+y le 100, x +y le 60 x ge 0 y ge 0`
consider the following graph

Then, the maximum profit to the dealer results from buying

A

10 tables and 50 chairs

B

50 tables and 10 chairs

C

0 table and 60 chairs

D

20 tables and 40 chairs

Text Solution

Verified by Experts

The correct Answer is:
A

The graph of the given constraints is shown below

The corner points of the feasible region are o (0, 0), A (20, 0), B (10, 50) and C (0, 60).

Hence, the maximum profit to the dealer results from the investment strategy (1 O, 50), i.e. buying 1 o tables and 50 chairs.
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

x + 2y le 40, 2x + y le 40, x ge 0, y ge 0

y - 2x le 1, x + y le 2, x ge 0, y ge 0

2x + y le 6, x + 2y le 8, x ge 0, y ge 0

3x + 4y le 60, x + 3y le 30, x ge 0, y ge 0

Z = 4x + y x + y le 50, 3x + y le 90, x ge 0, y ge 0

Z= 4x + 7y x + 2y le 20, x + y le 15, x ge 0, y ge 0 .

x+2y le 100,2x +y le 120,x+y le 70 , x ge 0, y ge 0

Maximise Z = 5x + 3y subject to 3x + 5y le 15, 5x + 2y le 10, x ge 0, y ge 0 .

MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS-Linear Programming -EXERCISE 2 (MISCELLANEOUS PROBLEMS )
  1. Consider the inequalities 5x1+4x2ge9,x1+x2 le 3, x1 ge 0 , x2 ge 0 Wh...

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

  12. Shaded region is represented by , the constraints

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

  20. Anil wants to invest at the most Rs.12000 in bonds. A and B. According...

    Text Solution

    |