Four tasks, `W`, `X`, `Y` and `Z`, must be completed.
Four workers, Julia, Ken, Lana and Max, will each do one task.
Table 1 shows the time, in minutes, that each person would take to complete each of the four tasks.
The tasks will be allocated so that the total time of completing the four tasks is a minimum.
The Hungarian method will be used to find the optimal allocation of tasks. Step 1 of the Hungarian method is to subtract the minimum entry in each row from each element in the row.
- Complete step 1 for task `X` by writing down the number missing from the shaded cell in Table 2. (1 mark)
--- 0 WORK AREA LINES (style=lined) ---
The second step of the Hungarian method ensures that all columns have at least one zero.
The numbers that result from this step are shown in Table 3 below.
- Following the Hungarian method, the smallest number of lines that can be drawn to cover the zeros is shown dashed in Table 3.
These dashed lines indicate that an optimal allocation cannot be made yet.
Give a reason why. (1 mark)
--- 2 WORK AREA LINES (style=lined) ---
- Complete the steps of the Hungarian method to produce a table tasks can be made.
Two blank tables have been provided for working if needed. (1 mark)
--- 0 WORK AREA LINES (style=lined) ---
- Write the name of the task that each person should do for the optimal allocation of tasks. (2 marks)
--- 0 WORK AREA LINES (style=lined) ---









































































