Quelpr
8 marksLinear Programming

CAPE Applied Mathematics Unit 2 · 2010 · Paper 2 · Question 1(a)(i)

A linear programming problem involves maximizing P = x + 2y subject to 3x + 17y ≤ 170, 7x + 8y ≤ 175, y ≤ 9, and x ≤ 20.

On the answer sheet provided, graph the feasible region for the programming problem.

The mark scheme is shown once you've answered.

Practise this question

Other parts of this question

  1. 1(a)(ii)Hence, solve the linear programming problem.[4 marks]
  2. 1(b)(i)Use the Hungarian algorithm to determine the task to which EACH person must be assigned in order to minimise the total time.[8 marks]
  3. 1(b)(ii)Hence, determine the total time taken by the FIVE persons.[2 marks]
  4. 1(c)For the diagram provided, list any THREE paths which start and finish at A.[3 marks]

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