D1 June 2014 (R) Q5
5. A linear programming problem in \(x\) and \(y\) is described as follows.
Maximise \(P = 2x + 3y\)
subject to
\[\begin{aligned} x &\geqslant 25\\ y &\geqslant 25\\ 7x + 8y &\leqslant 840\\ 4y &\leqslant 5x\\ 5y &\geqslant 3x\\ x,\ y &\geqslant 0 \end{aligned}\]Given that an integer solution is required,

| Scheme | Marks |
|---|---|
| B1 B1 B1 B1 R | |
| (4) |
Notes
In (a) lines must pass through one small square of the points stated:
\(7x + 8y = 840\) passes through (0, 105), (40, 70), (80, 35), (120, 0)
\(4y = 5x\) passes through (0, 0), (40, 50), (80, 100)
\(5y = 3x\) passes through (0, 0), (50, 30), (100, 60)
a1B1: One line other than \(x = 25\) or \(y = 25\) correctly drawn.
a2B1: Two lines other than \(x = 25\) or \(y = 25\) correctly drawn.
a3B1: All five lines correctly drawn.
a4B1: Region, R, correctly labelled – not just implied by shading – must have scored all three previous marks in this part.
| Scheme | Marks |
|---|---|
| Drawing an objective line accept reciprocal gradient | M1 |
| correct objective line minimum length equivalent to (0, 10) to (15,0) | A1 |
| V labelled correctly | A1 |
| (3) |
Notes
b1M1: Drawing the correct objective line or its reciprocal. Line must be correct to within one small square if extended from axis to axis.
b1A1: Correct objective line.
b2A1: V labelled clearly on their graph. This mark is dependent on the correct five line segments that define the boundary of the feasible region.
| Scheme | Marks |
|---|---|
| \(\text{V}\left(49\dfrac{7}{17},\ 61\dfrac{13}{17}\right)\) | M1 A1 |
| (2) |
Notes
cM1: Simultaneous equation being used to find their V (but not from \(x = 25\) or \(y = 25\)). Must get to \(x = \ldots\) and \(y = \ldots\)
cA1: Correct coordinates of V stated exactly as \(\left(\dfrac{840}{17},\ \dfrac{1050}{17}\right)\) or \(\left(49\dfrac{7}{17},\ 61\dfrac{13}{17}\right)\). If the correct coordinates are stated exactly with no working then this scores M1A0.
| Scheme | Marks |
|---|---|
| Testing the correct inequalities for points with integer coordinates | M1 |
| (50, 61) | A1 |
| (2) | |
| (11 marks) |
Notes
d1M1: Testing the correct inequalities for at least three of (49, 61), (49, 62), (50, 61), (50, 62).
d1A1: CAO (50, 61).