OCR MEI D1 2012 January — Question 3

Exam BoardOCR MEI
ModuleD1 (Decision Mathematics 1)
Year2012
SessionJanuary
TopicCurve Sketching
TypeLinear programming graphical method
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}$$
This paper (6 questions)
View full paper
Q1 Q2 Q3 Q4 Q5 Q6