A2 June 2024 Q3
3. The table below shows the cost, in pounds, of transporting one unit of stock from each of four supply points, E, F, G and H, to three sales points, A, B and C. It also shows the stock held at each supply point and the amount required at each sales point.
A minimum cost solution is required.
| A | B | C | Supply | |
|---|---|---|---|---|
| E | 23 | 28 | 22 | 21 |
| F | 26 | 19 | 29 | 32 |
| G | 29 | 24 | 20 | 29 |
| H | 24 | 26 | 19 | 23 |
| Demand | 45 | 19 | 23 |
| A | B | C | D | Supply | |
|---|---|---|---|---|---|
| E | 23 | 28 | 22 | 21 | |
| F | 26 | 19 | 29 | 32 | |
| G | 29 | 24 | 20 | 29 | |
| H | 24 | 26 | 19 | 23 | |
| Demand | 45 | 19 | 23 |
Table 1
After finding an initial feasible solution and applying one iteration of the stepping-stone method, the table becomes
| A | B | C | D | |
|---|---|---|---|---|
| E | 21 | |||
| F | 19 | 13 | ||
| G | 6 | 23 | ||
| H | 5 | 18 |
- shadow costs
- improvement indices
- entering and exiting cells
| Scheme | Marks | AO |
|---|---|---|
| (total) demand \(\neq\) (total) supply | B1 | 1.2 |
| (1) |
Notes
B1: CAO (or to make demand = supply or because (total) supply > (total) demand (oe))
Accept e.g. A dummy demand of 18 is needed to meet supply
or there is a total of 105 supply but only 87 demand
| Scheme | Marks | AO | ||||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| B1 | 1.1b | ||||||||||||||||||||||||||||||||||||
| (1) |
Notes
B1: CAO Check 18 in demand row
| Scheme | Marks | AO | ||||||||||||||||||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| M1 A1 | 2.1 1.1b | ||||||||||||||||||||||||||||||||||||||||||||||||||
| M1 A1 | 1.1b 1.1b | ||||||||||||||||||||||||||||||||||||||||||||||||||
| M1 A1 | 1.1b 2.2a | ||||||||||||||||||||||||||||||||||||||||||||||||||
| (6) |
Notes
M1: A valid route, only one empty square (GD) used, \(\theta\)s balance
A1: Correct route, up to an improved solution (seven numbers no zeros)
M1: Finding 8 shadow costs and 9 improvement indices
A1: Shadow costs and II correct (alternatives columns 0 -7 -4 -24 rows 23 26 24 24)
M1: A valid route, their most negative II chosen, only one empty square used, \(\theta\)s balance
A1: CSO (for part (c)) so all previous marks in this part must have been awarded – including exiting cells (GB and HD) and entering cell (FD) stated correctly (seven numbers no zeros)
| Scheme | Marks | AO |
|---|---|---|
| (£)1882 | B1 | 1.1b |
| (1) |
Notes
B1: CAO
| Scheme | Marks | AO | ||||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| M1 A1 | 2.1 1.1b | ||||||||||||||||||||||||||||||||||||
| All II are non-negative so solution is optimal | A1 | 2.4 | ||||||||||||||||||||||||||||||||||||
| (3) | ||||||||||||||||||||||||||||||||||||||
| (12 marks) |
Notes
M1: Finding 8 shadow costs and all 9 improvement indices (or 8 SC and at least 1 negative II)
A1: CAO for shadow costs and the 9 improvement indices (alternatives columns 0 -7 -6 -26 rows 23 26 26 24)
A1: CSO (for part (e)) + reason + optimal) accept positive instead of non-negative