A dairy cooperative has two chilling centres, A and B. On a certain day centre A has cans of milk and centre B has cans. Two retail booths, P and Q, need cans and cans respectively, and their needs must be met exactly. The cost of carrying one can is given below.
| From | To booth P | To booth Q |
|---|---|---|
| Centre A | ₹6 | ₹3 |
| Centre B | ₹5 | ₹4 |
Centre A sends cans to P and cans to Q, and centre B sends whatever else each booth needs. Neither centre can send more milk than it holds.
Attempt any four of the following five sub-questions.
(a) Express the numbers of cans sent from B to P and from B to Q in terms of and , and write down all the constraints on and .
(b) Show that the total transport cost is rupees.
(c) Find the corner points of the feasible region.
(d) Find the plan that makes the transport cost least, and the least cost.
(e) A clerk suggests that centre A should supply booth P completely and centre B should supply booth Q completely. Show that this plan is feasible and find how much more it costs than the cheapest plan.

