- Four workers, Ted (T), Harold (H), James (J) and Margaret (M), are to be assigned to four tasks, 1, 2, 3 and 4. Each worker must be assigned to just one task and each task must be done by just 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 |
| T | 103 | 97 | 74 | 80 |
| H | 201 | 155 | 145 | 155 |
| J | 111 | 80 | 77 | 92 |
| M | 203 | 188 | 137 | 184 |
- 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.
- Determine the resulting total profit.