Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Depot D1 holds crates and depot D2 holds crates. Shop S1 needs crates and shop S2 needs crates. The cost of one crate in rupees is from D1 to S1, from D1 to S2, from D2 to S1 and from D2 to S2. Let crates go from D1 to S1 and from D1 to S2. Find the cheapest plan: its total cost, the crates from D1 to S2 and the crates from D2 to S2. The corners of the region are , , , and .
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. D2 sends crates to S1 and to S2. The cost is rupees. The rules are for D1, which is for D2, , , and .
Step 2. The costs. At , . At , . At , . At , . At , . The smallest is .
Step 3. Say it. D1 sends crates to S1 and to S2. D2 sends to S1 and to S2. The total cost is rupees.
Check. The cost is rupees. D1 sends all its crates and D2 sends of its .
Log in to join the discussion.
Loading…