Home
Class 12
MATHS
A resourceful home decorator manufacture...

A resourceful home decorator manufactures two types of lamps say A and B. Both lamps go through two technician, first  a cutter, second a finisher. Lamp A requires 2 hours of th cutter’s time and 1 hour of the finisher’s time. Lamp B requires 1 hour of cutter’s and 2 hours of finisher’s time. The cutter has 104 hours and finisher has 76 hours of time available each month. Profit o one lamp A is Rs. 6.00 and on one lamp B is Rs.11.00. Assuming that he can sell all that he produces, how many of each type of lamps should he manufacture to obtain the best return.(formulate the LPP)

Promotional Banner

Topper's Solved these Questions

  • LINEAR PROGRAMING

    RD SHARMA ENGLISH|Exercise All Questions|4 Videos
  • MAXIMA AND MINIMA

    RD SHARMA ENGLISH|Exercise All Questions|309 Videos

Similar Questions

Explore conceptually related problems

A manufacturer produces two types of steel trunks. He has tow machines A and B. For completing, the first types of the trunk requires 3 hours on machine A and 3 hours on machine B, whereas the second type of the trunk requires 3 hours on machine A and 2 hours on machine B. Machines A and B can work at most for 18 hours and 15 hours per day respectively. He earns a profit of Rs. 30 and Rs. 25 per trunk of the first type and the second respectively. How many trunks of each type must he make each day to makes maximum profit?

A manufacturing companu makes two types of teaching aids A and B of Mathematics for Class X. Each type of A requires 9 labour hours for fabircating and 1 labour for finishing. Each type of B requires 12 labour hours for fabircating and 3 labour hours for finishing. For fabricating and finishing, the maximum labour hours available per week are 180 and 30 respectively. The company makes a profit of 80 on each piece of type A and 120 on each piece of type B. How many pieces of type A and types B should be manufactured per week to get a maximum profit? Formulae this as Linear Programming Problems and solved it. Identify the feasible region from the rough sketch.

Manufacturer produces two types of steel trunks. He has two machines, A and B. The first type of trunk requires 3 hours on machine A and 3 hours on machine B. The second type requires 3 hours on machine A and 2 hours on machine B. Machines A and B can work at most for 18 hours and 15 hours per day respectively. He earns a profit of Rs. 30 per trunk on the first type of trunk and Rs. 25 per trunk on the second type. Formulate a linear programming problem to find out how many trunks of each type he must make each day to maximize his profit.

Find the ratio of 1 hour to 12 hours.

A manufacturing company makes two models A and B of a product. Each piece of mode a requires 9 labour hours for fabricating and 1 labour hour for finishing. Each piece of Mode B requires 12 labour hours for fabricating and 3 labour hours for finishing. For fabricati2 and finishing, the maximum labour hours available are 180 and 30 respectively. The company makes a profit of Rs. 8000 on each piece of model A and Rs. 12000 on each piece of Model B. How many pieces of Model A and Model B should be manufactured per week to realise a maximum profit? What is the maximum profit per week?

A cottage industry manufactures pedestal lamps and wooden shades, each requiring the use of a grinding/cutting machine and a sprayer. It takes 2 hours on the grinding/cutting machine and 3 hours on the sprayer to manufacture a pedestal lamp. It takes 1 hour on the grinding/cutting machine and 2 hours on the sprayer to manufacture a shade. On any day, the sprayer is available for at the most 20 hours and the grinding/cutting machine for at the most 12 hours. The profit from the sale of a lamp is Rs. 25 and that from a shade is Rs. 15. Assuming that the manufacturer can sell all the lamps and shades that he produces, how should he schedule his daily production in order to maximise his profit. Formulate an LPP and solve it graphically.

A furniture form manufactures chairs and tables, each requiring the use of three machines A, B and C. Production of one chair requires 2 hours on machine A, 1 hour on machine B, and 1 hour on machine C. Each table requires 1 hour each on machines A and B and 3 hours on machine C. Profit realized by selling one chair is Rs. 30 while for a table the figure is Rs. 60. The total time available per week on machine A is 70 hours, on machine B is 40 hours, and on machine C is 90 hours. How many chairs and table should be made per week so as to maximize profit? Develop a mathematical formulation.

(Manufacturing problem) A manufacturing company makes two models A and B of a product. Each piece of Model A requires 9 labour hours for fabricating and 1 labour hour for finishing. Each piece of Model B requires 12 labour hours for fabricating and 3 labour hours for finishing. For fabricating and finishing, the maximum labour hours available are 180 and 30 respectively. The company makes a profit of Rs 8000 on each piece of model A and Rs 12000 on each piece of Model B. How many-pieces of Model A and Model B should be manufactured per week to realise a maximum profit? What is the maximum profit per week?

A manufacturer produces two products A and B. Both the products are processed on two different machines. The available capacity of first machine is 12 hours and that of second machine is 9 hours per day. Each unit of product A requires 3 hours on both machines and each unit of product B requires 2 hours on first machine and 1 hour on second machine. Each unit of product A is sold at Rs. 7 profit and that of B at a profit of Rs. 4. Find the production level per day for maximum profit graphically.

A cottage industry manufactures pedestal lamps and wooden shades, each requiring the use of grinding/cutting machine and a sprayer. It takes 2 hours on the grinding/cutting machine and 3 hours on the sprayer to manufacture a pedestal lamp. It takes one hour on the grinding/cutting machine and 2 hours on the sprayer to manufacture a shade. On any day, the sprayer is available for at the most 20 hours and the grinding/cutting machine for at the most 12 hours. The profit from the sale of a lamp is Rs. 5 and that from a shade is Rs. 3. Assuming that the manufacturer can sell all the lamps and shades that he produces, how should he schedule his daily production in order to maximise his profit? Make an L.P.P. and solve it graphically.

RD SHARMA ENGLISH-LINEAR PROGRAMMING -All Questions
  1. A furniture form manufactures chairs and tables, each requiring the us...

    Text Solution

    |

  2. A company makes two kinds of leather belts, A and B. Belt A is high ...

    Text Solution

    |

  3. A resourceful home decorator manufactures two types of lamps say A and...

    Text Solution

    |

  4. A diet is to contain at least 4000 units of carbohydrates, 500 units o...

    Text Solution

    |

  5. A dietician wishes to mix two types of food in such a way that the ...

    Text Solution

    |

  6. A dice is throwed once. Probability of getting 5

    Text Solution

    |

  7. A dietician has to develop a social diet using two foods P and Q. Each...

    Text Solution

    |

  8. A diet to two foods F1a n dF2 contains nutrients thiamine, phosphorous...

    Text Solution

    |

  9. Every gram of wheat provides 0.1 gm of proteins and 0.25 gm of carbohy...

    Text Solution

    |

  10. Kellogg is a new cereal formed of a mixture of bran and rice, that con...

    Text Solution

    |

  11. Solve the following liner programming problems by graphical method: Mi...

    Text Solution

    |

  12. Solve the following liner programming problems by graphical method: Ma...

    Text Solution

    |

  13. Solve the following liner programming problems by graphical method: Mi...

    Text Solution

    |

  14. Find the maximum and minimum value of 2x+y subject to the constraints:...

    Text Solution

    |

  15. There are two types of fertilisers ‘A’ and ‘B’. ‘A’ consists of 12% ...

    Text Solution

    |

  16. (Manufacturing problem) A manufacturing company makes two models A ...

    Text Solution

    |

  17. Solve the following linear programming problem graphically: Maximize Z...

    Text Solution

    |

  18. Determine graphically the minimum value of the objective function Z=...

    Text Solution

    |

  19. Solve the Following Linear Programming Problem graphically : Minim...

    Text Solution

    |

  20. A firm manufactures two products, each of which must be processed t...

    Text Solution

    |