Easy -1.2 This is a routine graphical linear programming question requiring students to complete a partially drawn feasible region and identify the optimal vertex. It involves standard D1 techniques (plotting constraints, shading regions, finding intersection points) with no conceptual challenges or novel problem-solving required—purely procedural execution of a well-practiced method.
1 Consider the following LP.
Maximise \(x + y\)
subject to \(2 x + y < 44\)
\(2 x + 3 y < 60\)
\(10 x + 11 y < 244\)
Part of a graphical solution is produced below and in your answer book.
Complete this graphical solution in your answer book.
\includegraphics[max width=\textwidth, alt={}, center]{8eba759f-38bc-4d14-ac65-9a0ee6c79741-2_1316_1346_916_356}
1 Consider the following LP.\\
Maximise $x + y$\\
subject to $2 x + y < 44$\\
$2 x + 3 y < 60$\\
$10 x + 11 y < 244$\\
Part of a graphical solution is produced below and in your answer book.\\
Complete this graphical solution in your answer book.\\
\includegraphics[max width=\textwidth, alt={}, center]{8eba759f-38bc-4d14-ac65-9a0ee6c79741-2_1316_1346_916_356}
\hfill \mbox{\textit{OCR MEI D1 2008 Q1 [8]}}