| Exam Board | OCR MEI |
|---|---|
| Module | D1 (Decision Mathematics 1) |
| Year | 2012 |
| Session | January |
| Marks | 8 |
| Paper | Download PDF ↗ |
| Topic | Linear Programming |
| Type | Graphical optimization with objective line |
| Difficulty | Moderate -0.8 This is a straightforward graphical linear programming question requiring students to plot three constraint lines, identify the feasible region, and find the optimal vertex. It's a standard textbook exercise with routine techniques and no conceptual challenges, making it easier than the average A-level question which typically requires more problem-solving or multi-step reasoning. |
| Spec | 7.06a LP formulation: variables, constraints, objective function7.06d Graphical solution: feasible region, two variables |
3 Solve the following LP problem graphically.\\
Maximise $2 x + 3 y$\\
subject to $\quad x + y \leqslant 11$
$$\begin{aligned}
3 x + 5 y & \leqslant 39 \\
x + 6 y & \leqslant 39 .
\end{aligned}$$
\hfill \mbox{\textit{OCR MEI D1 2012 Q3 [8]}}