- A company, Kleenitquick, has developed a new stain remover. To promote sales, three salespersons, Jess, Matt and Rachel, will be assigned to three of four department stores \(1,2,3\) and 4 , to demonstrate the stain remover. Each salesperson can only be assigned to one department store.
The table below shows the cost, in pounds, of assigning each salesperson to each department store.
| \(\mathbf { 1 }\) | \(\mathbf { 2 }\) | \(\mathbf { 3 }\) | \(\mathbf { 4 }\) |
| Jess | 15 | 11 | 14 | 12 |
| Matt | 13 | 8 | 17 | 13 |
| Rachel | 14 | 9 | 13 | 15 |
- Explain why a dummy row needs to be added to the table.
- Complete Table 1 in the answer book.
- Reducing rows first, use the Hungarian algorithm to obtain an allocation that minimises the cost of assigning salespersons to department stores. You must make your method clear and show the table after each iteration.
- Find the minimum cost.