Quelpr
9 marksAssignment Models

CAPE Applied Mathematics Unit 2 · 2016 · Paper 2 · Question 2(b)(i)

Travel times (in minutes) for four drivers (A, B, C, D) to four towns (R, H, S, P).

Use the Hungarian algorithm to determine the optimal assignment of each driver to a town to minimize total travel time.

This question uses a figure or table from the paper — you'll see it when you practise.

The mark scheme is shown once you've answered.

Practise this question

Other parts of this question

  1. 2(a)(i)Calculate the probability that all three markers are red.[2 marks]
  2. 2(a)(ii)Calculate the probability that exactly two of the markers are black.[4 marks]
  3. 2(b)(i)Find the probability that a randomly chosen customer spends more than 8 minutes completing a transaction.[4 marks]
  4. 2(b)(ii)Find the time below which 80% of customers spend completing a transaction.[4 marks]
  5. 2(c)(i)In a random sample of 10 households, calculate the probability that exactly 6 have internet access.[4 marks]
  6. 2(c)(ii)In a random sample of 80 households, calculate the expected number that have internet access.[2 marks]
  7. 2(a)(i)On the provided grid, draw the system of inequalities representing the constraints.[9 marks]
  8. 2(a)(ii)Using the same grid, shade the feasible region.[2 marks]
  9. 2(a)(iii)Use your diagram to find the maximum value of P.[3 marks]
  10. 2(b)(ii)Determine the total minimum time taken by the four drivers.[2 marks]

More practice: the rest of this paper · more Assignment Models questions · all CAPE Applied Mathematics Unit 2 past papers