Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Warehouse W1 holds units and warehouse W2 holds units. Shop S1 needs units and shop S2 needs units. The cost of one unit in rupees is from W1 to S1, from W1 to S2, from W2 to S1 and from W2 to S2. Let units go from W1 to S1 and from W1 to S2. W2 sends the rest. Find the cheapest plan and its cost. The corners of the region are , , and . Say how many units each warehouse sends to each shop.
In a transport problem choose two shipments as and . The needs of the shops give the other shipments. All four must be at least , and each depot must send no more than it holds. An allocation problem splits a fixed amount. If whole numbers are needed, test the whole-number plans near the best corner.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Step 1. The model. The cost is rupees. The rules are for W1, for W2, , , and .
Step 2. The corners. The lines and cross at and , and cross at and . These four points are the corners.
Step 3. The costs. At , . At , . At , . At , . The smallest is .
Step 4. Say it. W1 sends units to S1 and units to S2. W2 sends units to S1 and units to S2.
Check. The cost is rupees. W1 sends units, below its , and W2 sends all its .
Log in to join the discussion.
Loading…