- Four workers, Chris (C), James (J), Katie (K) and Nicky (N), are to be allocated to four tasks, 1, 2, 3 and 4. Each worker is to be allocated to one task and each task must be allocated to one worker.
The profit, in pounds, resulting from allocating each worker to each task, is shown in the table below. The profit is to be maximised.
| 1 | 2 | 3 | 4 |
| Chris | 127 | 116 | 111 | 113 |
| James | 225 | 208 | 205 | 208 |
| Katie | 130 | 113 | 112 | 114 |
| Nicky | 228 | 212 | 203 | 210 |
- Reducing rows first, use the Hungarian algorithm to obtain an allocation that maximises the total profit. You must make your method clear and show the table after each stage.
- State which worker should be allocated to each task and the resulting total profit made.