AQA D2 2011 June — Question 4 15 marks

Exam BoardAQA
ModuleD2 (Decision Mathematics 2)
Year2011
SessionJune
Marks15
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicThe Simplex Algorithm
TypeWrite constraints from tableau
DifficultyModerate -0.8 Part (a) is a straightforward reading of constraints from a tableau (routine mechanical task). Parts (b) and (c) involve standard Simplex iterations following the algorithm mechanically. The only slight challenge is part (b)(ii) requiring interpretation of optimality conditions involving parameter k, but this is still a standard D2 exercise with no novel problem-solving required.
Spec7.06a LP formulation: variables, constraints, objective function7.06b Slack variables: converting inequalities to equations7.07a Simplex tableau: initial setup in standard format7.07b Simplex iterations: pivot choice and row operations7.07c Interpret simplex: values of variables, slack, and objective

4 A linear programming problem involving variables \(x , y\) and \(z\) is to be solved. The objective function to be maximised is \(P = 2 x + 6 y + k z\), where \(k\) is a constant. The initial Simplex tableau is given below.
\(\boldsymbol { P }\)\(x\)\(y\)\(\boldsymbol { Z }\)\(\boldsymbol { s }\)\(\boldsymbol { t }\)\(\boldsymbol { u }\)value
1-2-6\(- k\)0000
0531010015
076401028
043600112
  1. In addition to \(x \geqslant 0 , y \geqslant 0 , z \geqslant 0\), write down three inequalities involving \(x , y\) and \(z\) for this problem.
    1. By choosing the first pivot from the \(\boldsymbol { y }\)-column, perform one iteration of the Simplex method.
    2. Given that the optimal value has not been reached, find the possible values of \(k\).
  2. In the case when \(k = 20\) :
    1. perform one further iteration;
    2. interpret the final tableau and state the values of the slack variables.

Question 4:
Part (a):
AnswerMarks Guidance
\(5x + 3y + 10z \leq 15\) (or equivalent from row 2)B1 One correct inequality from tableau rows
\(7x + 6y + 4z \leq 28\) (or equivalent from row 3)B1 Second and third correct inequalities
\(4x + 3y + 6z \leq 12\) (or equivalent from row 4)
Part (b)(i):
AnswerMarks Guidance
Pivot column is \(y\), ratios: \(15/3=5\), \(28/6=4\frac{2}{3}\), \(12/3=4\), so pivot row is row 4, pivot element is 3M1 Correct identification of pivot
New row 4: \(0, \frac{4}{3}, 1, 2, 0, 0, \frac{1}{3}, 4\)A1 Correct pivot row after division
New objective row: \(1, 6, 0, k-12, 0, 0, 2, 24\)A1 Correct objective row
Remaining rows updated correctlyA1 All rows correct
Updated tableau:
AnswerMarks Guidance
\(P\)\(x\) \(y\)
\(1\)\(6\) \(0\)
\(0\)\(3\) \(0\)
\(0\)\(3\) \(0\)
\(0\)\(\frac{4}{3}\) \(1\)
Part (b)(ii):
AnswerMarks Guidance
For optimal not reached, need at least one negative value in objective rowM1 Correct reasoning
\(k - 12 < 0\) or \(6 < 0\) (impossible), so \(k < 12\)A1 \(k < 12\)
Part (c)(i): (when \(k=20\))
AnswerMarks Guidance
Objective row becomes \(1, 6, 0, 8, 0, 0, 2, 24\); pivot column is \(x\), ratios: \(3/3=1\), \(4/3\), \(4/(\frac{4}{3})=3\); pivot element is 3 in row 1M1 Correct pivot identified
New pivot row: \(0, 1, 0, \frac{4}{3}, \frac{1}{3}, 0, -\frac{1}{3}, 1\)A1 Correct row
New objective row: \(1, 0, 0, \ldots, -2, 0, 4, 18\)A1
All rows correctA1 Fully correct tableau
Part (c)(ii):
AnswerMarks Guidance
\(P = 18\), \(x=1\), \(y=4\), \(z=0\)B1 Correct values stated
Slack variables: \(s=0\), \(t=0\), \(u=0\)B1 All slack variables correct
Constraints 1, 2 and 3 are all binding (active)B1 Correct interpretation
# Question 4:

## Part (a):
| $5x + 3y + 10z \leq 15$ (or equivalent from row 2) | B1 | One correct inequality from tableau rows |
| $7x + 6y + 4z \leq 28$ (or equivalent from row 3) | B1 | Second and third correct inequalities |
| $4x + 3y + 6z \leq 12$ (or equivalent from row 4) | | |

## Part (b)(i):
| Pivot column is $y$, ratios: $15/3=5$, $28/6=4\frac{2}{3}$, $12/3=4$, so pivot row is row 4, pivot element is 3 | M1 | Correct identification of pivot |
| New row 4: $0, \frac{4}{3}, 1, 2, 0, 0, \frac{1}{3}, 4$ | A1 | Correct pivot row after division |
| New objective row: $1, 6, 0, k-12, 0, 0, 2, 24$ | A1 | Correct objective row |
| Remaining rows updated correctly | A1 | All rows correct |

Updated tableau:

| $P$ | $x$ | $y$ | $z$ | $s$ | $t$ | $u$ | value |
|---|---|---|---|---|---|---|---|
| $1$ | $6$ | $0$ | $k-12$ | $0$ | $0$ | $2$ | $24$ |
| $0$ | $3$ | $0$ | $4$ | $1$ | $0$ | $-1$ | $3$ |
| $0$ | $3$ | $0$ | $-8$ | $0$ | $1$ | $-2$ | $4$ |
| $0$ | $\frac{4}{3}$ | $1$ | $2$ | $0$ | $0$ | $\frac{1}{3}$ | $4$ |

## Part (b)(ii):
| For optimal not reached, need at least one negative value in objective row | M1 | Correct reasoning |
| $k - 12 < 0$ or $6 < 0$ (impossible), so $k < 12$ | A1 | $k < 12$ |

## Part (c)(i): (when $k=20$)
| Objective row becomes $1, 6, 0, 8, 0, 0, 2, 24$; pivot column is $x$, ratios: $3/3=1$, $4/3$, $4/(\frac{4}{3})=3$; pivot element is 3 in row 1 | M1 | Correct pivot identified |
| New pivot row: $0, 1, 0, \frac{4}{3}, \frac{1}{3}, 0, -\frac{1}{3}, 1$ | A1 | Correct row |
| New objective row: $1, 0, 0, \ldots, -2, 0, 4, 18$ | A1 | |
| All rows correct | A1 | Fully correct tableau |

## Part (c)(ii):
| $P = 18$, $x=1$, $y=4$, $z=0$ | B1 | Correct values stated |
| Slack variables: $s=0$, $t=0$, $u=0$ | B1 | All slack variables correct |
| Constraints 1, 2 and 3 are all binding (active) | B1 | Correct interpretation |

---
4 A linear programming problem involving variables $x , y$ and $z$ is to be solved. The objective function to be maximised is $P = 2 x + 6 y + k z$, where $k$ is a constant.

The initial Simplex tableau is given below.

\begin{center}
\begin{tabular}{|l|l|l|l|l|l|l|l|}
\hline
$\boldsymbol { P }$ & $x$ & $y$ & $\boldsymbol { Z }$ & $\boldsymbol { s }$ & $\boldsymbol { t }$ & $\boldsymbol { u }$ & value \\
\hline
1 & -2 & -6 & $- k$ & 0 & 0 & 0 & 0 \\
\hline
0 & 5 & 3 & 10 & 1 & 0 & 0 & 15 \\
\hline
0 & 7 & 6 & 4 & 0 & 1 & 0 & 28 \\
\hline
0 & 4 & 3 & 6 & 0 & 0 & 1 & 12 \\
\hline
\end{tabular}
\end{center}
\begin{enumerate}[label=(\alph*)]
\item In addition to $x \geqslant 0 , y \geqslant 0 , z \geqslant 0$, write down three inequalities involving $x , y$ and $z$ for this problem.
\item \begin{enumerate}[label=(\roman*)]
\item By choosing the first pivot from the $\boldsymbol { y }$-column, perform one iteration of the Simplex method.
\item Given that the optimal value has not been reached, find the possible values of $k$.
\end{enumerate}\item In the case when $k = 20$ :
\begin{enumerate}[label=(\roman*)]
\item perform one further iteration;
\item interpret the final tableau and state the values of the slack variables.
\end{enumerate}\end{enumerate}

\hfill \mbox{\textit{AQA D2 2011 Q4 [15]}}