D1 June 2019 Q6

EdexcelOld spec10 marksLinear Programming

6.

Figure 4: feasible region R, a quadrilateral with vertices A, B, C and D, on axes x from -3 to 6 and y from 0 to 8
Figure 4

Figure 4 shows the constraints of a linear programming problem in \(x\) and \(y\), where \(R\) is the feasible region.

The vertices of the feasible region are \(A(4, 7)\), \(B(5, 3)\), \(C(-1, 5)\) and \(D(-2, 1)\).

(a) Determine the inequality that defines the boundary of \(R\) that passes through vertices \(A\) and \(C\), leaving your answer with integer coefficients only. (3)

The objective is to maximise \(P = 5x + y\)

(b) Find the coordinates of the optimal vertex and the corresponding value of \(P\). (3)

The objective is changed to maximise \(Q = kx + y\)

(c) If \(k\) can take any value, find the range of values of \(k\) for which \(A\) is the only optimal vertex. (4)