| Exam Board | OCR |
|---|---|
| Module | D1 (Decision Mathematics 1) |
| Year | 2005 |
| Session | January |
| Marks | 13 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Linear Programming |
| Type | Parametric objective analysis |
| Difficulty | Standard +0.8 Part (i) is routine reading from a graph, part (ii) is standard vertex method for linear programming. However, part (iii) requires conceptual understanding of how changing the objective function coefficient affects which vertex is optimal, involving analysis of gradient conditions—this parametric analysis elevates it above typical D1 questions which usually just ask for a single optimization. |
| Spec | 7.06d Graphical solution: feasible region, two variables7.06e Sensitivity analysis: effect of changing coefficients |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Mark | Guidance |
| \(x \geq 0,\ y \geq 0\) | B1 | For both trivial constraints; allow \(>\) |
| \(y \leq 2x + 1\) | B1 | For this inequality or equivalent; allow \(<\) |
| \(4x + 3y \leq 12\) | B1 | For this inequality or equivalent; allow \(<\) |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Mark | Guidance |
| \((0,0)\), \((3,0)\), \((0,1)\) | B2 | For these three vertices, any two correct \(\Rightarrow\) B1 |
| \((0.9, 2.8)\) | B1 | For this vertex exact, in decimals or fractions |
| \((0,0) \to P=0\); \((0,1) \to P=3\); \((0.9, 2.8) \to P=12.9\); \((3,0) \to P=15\) | M1 | For calculating \(P = 5x + 3y\) for at least one of their vertices or clear evidence of using an appropriate line of constant profit |
| \(x = 3\) and \(y = 0\) | A1 | For the correct values of \(x\) and \(y\) clearly identified |
| \(P = 15\) | A1 | For 15 clearly identified as the optimum value |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Mark | Guidance |
| Either consider the gradient of the profit line \((-\frac{1}{3}a)\) and the gradients of the boundary lines \((2\) and \(-1\frac{1}{2})\) | M1 | One method mark for each appropriate gradient calculated correctly |
| Or calculate \(Q\) at vertices \(\Rightarrow 3,\ 0.9a+8.4,\ 3a\) | M1 | Or for each appropriate value of \(Q\) calculated correctly |
| Hence require \(a \leq -6\) | M1 A1 | For the correct set of values identified. \([a = -6\) or any valid proper subset of the correct answer with no method shown \(\Rightarrow\) B1 only\(]\) |
# Question 5:
## Part (i)
| Answer | Mark | Guidance |
|--------|------|----------|
| $x \geq 0,\ y \geq 0$ | B1 | For both trivial constraints; allow $>$ |
| $y \leq 2x + 1$ | B1 | For this inequality or equivalent; allow $<$ |
| $4x + 3y \leq 12$ | B1 | For this inequality or equivalent; allow $<$ |
## Part (ii)
| Answer | Mark | Guidance |
|--------|------|----------|
| $(0,0)$, $(3,0)$, $(0,1)$ | B2 | For these three vertices, any two correct $\Rightarrow$ B1 |
| $(0.9, 2.8)$ | B1 | For this vertex exact, in decimals or fractions |
| $(0,0) \to P=0$; $(0,1) \to P=3$; $(0.9, 2.8) \to P=12.9$; $(3,0) \to P=15$ | M1 | For calculating $P = 5x + 3y$ for at least one of their vertices or clear evidence of using an appropriate line of constant profit |
| $x = 3$ and $y = 0$ | A1 | For the correct values of $x$ and $y$ clearly identified |
| $P = 15$ | A1 | For 15 clearly identified as the optimum value |
## Part (iii)
| Answer | Mark | Guidance |
|--------|------|----------|
| Either consider the gradient of the profit line $(-\frac{1}{3}a)$ and the gradients of the boundary lines $(2$ and $-1\frac{1}{2})$ | M1 | One method mark for each appropriate gradient calculated correctly |
| Or calculate $Q$ at vertices $\Rightarrow 3,\ 0.9a+8.4,\ 3a$ | M1 | Or for each appropriate value of $Q$ calculated correctly |
| Hence require $a \leq -6$ | M1 A1 | For the correct set of values identified. $[a = -6$ or any valid proper subset of the correct answer with no method shown $\Rightarrow$ B1 only$]$ |
---
5 The constraints of a linear programming problem are represented by the graph below. The feasible region is the unshaded region, including its boundaries.\\
\includegraphics[max width=\textwidth, alt={}, center]{197624b2-ca67-4bad-9c2c-dc68c10be0fd-04_1118_816_404_662}\\
(i) Write down four inequalities that define the feasible region.
The objective is to maximise $P = 5 x + 3 y$.\\
(ii) Using the graph or otherwise, obtain the coordinates of the vertices of the feasible region and hence find the values of $x$ and $y$ that maximise $P$, and the corresponding maximum value of $P$.
The objective is changed to maximise $Q = a x + 3 y$.\\
(iii) For what set of values of $a$ is the maximum value of $Q$ equal to 3?
\hfill \mbox{\textit{OCR D1 2005 Q5 [13]}}