Quelpr
2 marksGraph Theory and Critical Path Analysis

CAPE Applied Mathematics Unit 2 · 2015 · Paper 2 · Question 1(b)

A network diagram shows travel times between Town S and Town G along several roads.

Determine the SHORTEST and LONGEST path from Town S to Town G.

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. 1(a)(i)a)By identifying the variables, formulate the profit function that needs to be solved.[3 marks]
  2. 1(a)(i)b)Formulate the inequalities to be used to solve this problem.[7 marks]
  3. 1(a)(ii)a)On the graph sheet provided, draw the graphs of the inequalities obtained in (i) b).[6 marks]
  4. 1(a)(ii)b)Identify the feasible region to solve the problem.[2 marks]
  5. 1(a)(iii)a)From your graph, determine the number of EACH type of bottle required for maximum profit.[3 marks]
  6. 1(a)(iii)b)Determine the maximum profit.[2 marks]

More practice: the rest of this paper · more Graph Theory and Critical Path Analysis questions · all CAPE Applied Mathematics Unit 2 past papers