Let bricks be transported from to and y bricks be transported from to .
Therefore, will be transported to .
Also, (15000-x) bricks, ( bricks and bricks will be transported to A, B, C from .
According to the question,
Minimize 15000)
The feasible region represented by is given by
The corner points of feasible region are ,
The minimum value of is 1200 at point .
Hence, bricks should be transported from P to A, B, C and bricks shoull transported from to .