A brick manufacture has two depots, P and Q, with stocks of 30000 and 20000 bricks respectively. He receives order from three building A, B, C, for 15000, 20000 and 15000 bricks respectively. The costs of transporting 1000 bricks to the building from the depots are given below.
How should the manufacture fulfill the orders so as to keep the cost of transportation minimum?
Let x bricks be transported from P to A and y bricks be transported from P to B.
Therefore, 30000 - (x + y) will be transported to C.
Also, (15000 - x) bricks, (20000 - y) bricks and (15000 - (30000 - (x + y))) bricks will be transported to A, B, C from Q.
∴According to the question,
Minimize Z = 0.04x + 0.02(15000 - x) + 0.02y + 0.06(20000 - y) + 0.03(30000 - (x + y)) + 0.04((x + y) – 15000)
Z = 0.03x - 0.03y + 1800
The feasible region represented by x is given by
The corner points of feasible region are A(0,15000) , B(0,20000) , C(10000,20000) , D(15000,15000), E(15000,0).
The minimum value of Z is 1200 at point (0,20000).
Hence, 0, 20000, 10000 bricks should be transported from P to A, B, C and 15000, 0, 5000 bricks should be transported from Q to A, B, C.
Rate this question :
A manufacturer produces two products A and B. Both the products are processed on two different machines. The available capacity of the first machine is 12 hours and that of the 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 the first machine and 1 hour on the second machine. Each unit of product A is sold at ` 7 profit and that of B at a profit of ` 4. Find the production level per day for maximum profit graphically.Mathematics - Board Papers
A retired person wants to invest an amount of ₹ 50,000. His broker recommends investing in two types of bonds ‘A’ and ‘B’ yielding 10% and 9% return respectively on the invested amount. He decides to invest at least ₹ 20,000 in bond ‘A’ and at least ₹ 10,000 in bond ‘B’. He also wants to invest at least as much in bond ‘A’ as in bond ‘B’. Solve this linear programming problem graphically to maximize his returns.Mathematics - Board Papers
A manufacturing company makes two types of teaching aids A and B of Mathematics for class XII. Each type of A requires 9 labour hours of fabricating and 1 labour hour for finishing. Each type of B requires 12 labour hours for fabricating 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 Rs80 on each piece of type A, and Rs120 on each piece of type B. How many pieces of type A and type B should be manufactured per week to get a maximum profit? Make it as an LPP and solve graphically. What is the maximum profit per week?Mathematics - Board Papers