3. The table below shows the cost, in pounds, of transporting one tonne of concrete from each of three supply depots, \(\mathrm { A } , \mathrm { B }\) and C , to each of four building sites, \(\mathrm { D } , \mathrm { E } , \mathrm { F }\) and G . It also shows the number of tonnes that can be supplied from each depot and the number of tonnes required at each building site. A minimum cost solution is required.
| D | E | F | G | Supply |
| A | 17 | 19 | 21 | 20 | 18 |
| B | 21 | 20 | 19 | 22 | 23 |
| C | 18 | 17 | 16 | 21 | 29 |
| Demand | 15 | 24 | 18 | 13 | |
The north-west corner method gives the following possible solution.
| D | E | F | G | Supply |
| A | 15 | 3 | | | 18 |
| B | | 21 | 2 | | 23 |
| C | | | 16 | 13 | 29 |
| Demand | 15 | 24 | 18 | 13 | |
Taking AG as the first entering cell,
- use the stepping stone method twice to obtain an improved solution. You must make your method clear by stating your shadow costs, improvement indices, routes, entering cells and exiting cells.
- Determine whether your current solution is optimal. Justify your answer.