Quelpr
8 marksAssignment Models

CAPE Applied Mathematics Unit 2 · 2013 · Paper 2 · Question 2(c)(i)

Cost matrix for transporting an item from warehouses W_1, W_2, W_3, W_4 to supermarkets S_1, S_2, S_3, S_4.

Use the Hungarian algorithm to determine the supermarket to which EACH warehouse must be assigned in order to MINIMIZE the cost of delivery.

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)Determine the EARLIEST start times of the activities S and X.[3 marks]
  2. 2(a)(ii)Determine the MINIMUM completion time of the project.[2 marks]
  3. 2(a)(iii)Determine the LATEST start times of the activities X and Q.[3 marks]
  4. 2(a)(iv)Determine a critical path of the activity network.[2 marks]
  5. 2(a)(v)Determine the float time for activity T.[3 marks]
  6. 2(b)State the degree of the vertices A and C.[2 marks]
  7. 2(c)(ii)Hence, determine the total cost for EACH item at the four warehouses.[2 marks]

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