OCR D2 2013 January — Question 3 12 marks

Exam BoardOCR
ModuleD2 (Decision Mathematics 2)
Year2013
SessionJanuary
Marks12
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicMatchings and Allocation
TypeHungarian algorithm for maximisation
DifficultyModerate -0.5 This is a standard application of the Hungarian algorithm with clear step-by-step instructions. The maximisation-to-minimisation conversion is explicitly guided, and the algorithm itself is routine for D2 students. Part (iii) requires some logical reasoning about constrained optimality, but the constraint simplifies rather than complicates the problem. Slightly easier than average due to the scaffolding provided.
Spec7.03l Bin packing: next-fit, first-fit, first-fit decreasing, full bin

3 Agatha Parrot is in her garden and overhears her neighbours talking about four new people who have moved into her village. Each of the new people has a different job, and Agatha's neighbours are guessing who has which job. Using the information she has overheard, Agatha counts how many times she heard it guessed that each person has each job.
NursePolice officerRadiographerTeacher
Jill Jenkins7888
Kevin Keast8457
Liz Lomax5104
Mike Mitchell8344
Agatha wants to find the allocation of people to jobs that maximises the total number of correct guesses. She intends to use the Hungarian algorithm to do this. She starts by subtracting each value in the table from 10.
  1. Write down the table which Agatha gets after she has subtracted each value from 10. Explain why she did a subtraction.
  2. Apply the Hungarian algorithm, reducing rows first, to find which job Agatha concludes each person has. State how each table of working was calculated from the previous one. Agatha later meets Liz Lomax and is surprised to find out that she is the radiographer.
  3. Using this additional information, but without formally using the Hungarian algorithm, find which job Agatha should now conclude each person has. Explain how you know that there is no better solution in which Liz is the radiographer.

3 Agatha Parrot is in her garden and overhears her neighbours talking about four new people who have moved into her village. Each of the new people has a different job, and Agatha's neighbours are guessing who has which job.

Using the information she has overheard, Agatha counts how many times she heard it guessed that each person has each job.

\begin{center}
\begin{tabular}{|l|l|l|l|l|}
\hline
 & Nurse & Police officer & Radiographer & Teacher \\
\hline
Jill Jenkins & 7 & 8 & 8 & 8 \\
\hline
Kevin Keast & 8 & 4 & 5 & 7 \\
\hline
Liz Lomax & 5 & 1 & 0 & 4 \\
\hline
Mike Mitchell & 8 & 3 & 4 & 4 \\
\hline
\end{tabular}
\end{center}

Agatha wants to find the allocation of people to jobs that maximises the total number of correct guesses. She intends to use the Hungarian algorithm to do this. She starts by subtracting each value in the table from 10.\\
(i) Write down the table which Agatha gets after she has subtracted each value from 10. Explain why she did a subtraction.\\
(ii) Apply the Hungarian algorithm, reducing rows first, to find which job Agatha concludes each person has. State how each table of working was calculated from the previous one.

Agatha later meets Liz Lomax and is surprised to find out that she is the radiographer.\\
(iii) Using this additional information, but without formally using the Hungarian algorithm, find which job Agatha should now conclude each person has. Explain how you know that there is no better solution in which Liz is the radiographer.

\hfill \mbox{\textit{OCR D2 2013 Q3 [12]}}