Edexcel D2 2006 January — Question 1

Exam BoardEdexcel
ModuleD2 (Decision Mathematics 2)
Year2006
SessionJanuary
TopicPermutations & Arrangements
TypeOptimization assignment problems

  1. A theme park has four sites, A, B, C and D, on which to put kiosks. Each kiosk will sell a different type of refreshment. The income from each kiosk depends upon what it sells and where it is located. The table below shows the expected daily income, in pounds, from each kiosk at each site.
Hot dogs and beef burgers (H)Ice cream (I)Popcorn, candyfloss and drinks (P)Snacks and hot drinks (S)
Site A267272276261
Site B264271278263
Site C267273275263
Site D261269274257
Reducing rows first, use the Hungarian algorithm to determine a site for each kiosk in order to maximise the total income. State the site for each kiosk and the total expected income. You must make your method clear and show the table after each stage.
(Total 13 marks)