Q. 26

# 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?

Answer :

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,

x

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 :