Hungarian algorithm for maximisation

A question is this type if and only if it asks to use the Hungarian algorithm to maximise total profit or score, requiring table modification by subtracting from a maximum value.

27 questions · Moderate -0.3

Sort by: Default | Easiest first | Hardest first
OCR D2 Q3
10 marks Standard +0.3
3. A travel company offers a touring holiday which stops at four locations, \(A , B , C\) and \(D\). The tour may be taken with the locations appearing in any order, but the number of days spent in each location is dependent on its position in the tour, as shown in the table below.
\multirow{2}{*}{}Stage
1234
A7856
\(B\)6965
C9857
\(D\)7766
Showing the state of the table at each stage, use the Hungarian algorithm to find the order in which to complete the tour so as to maximise the total number of days. State the maximum total number of days that can be spent in the four locations.
Edexcel D2 2004 June Q2
9 marks Moderate -0.8
In a quiz there are four individual rounds, Art, Literature, Music and Science. A team consists of four people, Donna, Hannah, Kerwin and Thomas. Each of four rounds must be answered by a different team member. The table shows the number of points that each team member is likely to get on each individual round.
ArtLiteratureMusicScience
Donna31243235
Hannah16101922
Kerwin19142021
Thomas18152123
Use the Hungarian algorithm, reducing rows first, to obtain an allocation which maximises the total points likely to be scored in the four rounds. You must make your method clear and show the table after each stage. [9] (Total 9 marks)