A2 June 2025 Q5

EdexcelCurrent spec12 marksLinear Programming

5. Consider the following linear programming problem in \(x\), \(y\) and \(z\).

Maximise \(P = 3x + 4y + 2z\)

subject to \[\begin{aligned} 2x + 2y + 2z &\leqslant 21 \\ 2x - y - z &\leqslant 18 \\ -3x + y - 2z &\leqslant 1 \end{aligned}\] \[x \geqslant 4 \qquad y \geqslant 1 \qquad z \leqslant -3\]

(a) Explain why the Simplex algorithm cannot be used to solve this linear programming problem in its current form. (1)
(b) Use the substitutions \(x = X + 4,\ y = Y + 1,\ z = -Z - 3\) and \(P = Q + 10\) to reformulate the linear programming problem into a form in which the Simplex algorithm can be used to solve the problem. You should write the constraints as simplified inequalities with integer coefficients. (3)

After a second iteration of the Simplex algorithm, a possible tableau \(T\) is

b.v.\(X\)\(Y\)\(Z\)\(s_1\)\(s_2\)\(s_3\)Value
\(X\)10\(-\dfrac{3}{4}\)\(\dfrac{1}{8}\)0\(-\dfrac{1}{4}\)\(\dfrac{5}{8}\)
\(s_2\)00\(\dfrac{9}{4}\)\(\dfrac{1}{8}\)1\(\dfrac{3}{4}\)\(\dfrac{117}{8}\)
\(Y\)01\(-\dfrac{1}{4}\)\(\dfrac{3}{8}\)0\(\dfrac{1}{4}\)\(\dfrac{63}{8}\)
\(Q\)00\(-\dfrac{5}{4}\)\(\dfrac{15}{8}\)0\(\dfrac{1}{4}\)\(\dfrac{267}{8}\)
(c) Write down the profit equation given by \(T\). (1)
(d) Using your answer to (c), explain why \(T\) is not optimal. (1)
(e)
(i) Perform the third iteration of the Simplex algorithm. You should state the row operations you use.
(ii) Hence determine the maximum value of \(P\), and the corresponding values of \(x\), \(y\) and \(z\). (6)