AQA D2 2010 January — Question 4 14 marks

Exam BoardAQA
ModuleD2 (Decision Mathematics 2)
Year2010
SessionJanuary
Marks14
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicThe Simplex Algorithm
TypeComplete Simplex solution
DifficultyStandard +0.3 This is a standard, methodical Simplex algorithm question requiring routine application of the pivot procedure. While it involves multiple steps, each follows a well-defined algorithmic process taught directly in D2. The question guides students through each stage (identifying slack variables, performing iterations, interpreting results) with no novel problem-solving or insight required—just careful arithmetic and procedure following.
Spec7.07a Simplex tableau: initial setup in standard format7.07b Simplex iterations: pivot choice and row operations7.07c Interpret simplex: values of variables, slack, and objective7.07d Simplex terminology: basic feasible solution, basic/non-basic variable7.07e Graphical interpretation: iterations as edges of convex polygon7.07f Algebraic interpretation: explain simplex calculations

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 + 4 y + 3 z\). The initial Simplex tableau is given below.
\(\boldsymbol { P }\)\(\boldsymbol { x }\)\(\boldsymbol { y }\)\(\boldsymbol { Z }\)\(s\)\(t\)\(\boldsymbol { u }\)value
1-2-4-30000
022110014
0-1120106
044300129
    1. What name is given to the variables \(s , t\) and \(u\) ?
    2. Write down an equation involving \(x , y , z\) and \(s\) for this problem.
    1. By choosing the first pivot from the \(\boldsymbol { y }\)-column, perform one iteration of the Simplex method.
    2. Explain how you know that the optimal value has not been reached.
    1. Perform one further iteration.
    2. Interpret the final tableau, stating the values of \(P , x , y\) and \(z\).

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 + 4 y + 3 z$. The initial Simplex tableau is given below.

\begin{center}
\begin{tabular}{|l|l|l|l|l|l|l|l|}
\hline
$\boldsymbol { P }$ & $\boldsymbol { x }$ & $\boldsymbol { y }$ & $\boldsymbol { Z }$ & $s$ & $t$ & $\boldsymbol { u }$ & value \\
\hline
1 & -2 & -4 & -3 & 0 & 0 & 0 & 0 \\
\hline
0 & 2 & 2 & 1 & 1 & 0 & 0 & 14 \\
\hline
0 & -1 & 1 & 2 & 0 & 1 & 0 & 6 \\
\hline
0 & 4 & 4 & 3 & 0 & 0 & 1 & 29 \\
\hline
\end{tabular}
\end{center}
\begin{enumerate}[label=(\alph*)]
\item \begin{enumerate}[label=(\roman*)]
\item What name is given to the variables $s , t$ and $u$ ?
\item Write down an equation involving $x , y , z$ and $s$ for this problem.
\end{enumerate}\item \begin{enumerate}[label=(\roman*)]
\item By choosing the first pivot from the $\boldsymbol { y }$-column, perform one iteration of the Simplex method.
\item Explain how you know that the optimal value has not been reached.
\end{enumerate}\item \begin{enumerate}[label=(\roman*)]
\item Perform one further iteration.
\item Interpret the final tableau, stating the values of $P , x , y$ and $z$.
\end{enumerate}\end{enumerate}

\hfill \mbox{\textit{AQA D2 2010 Q4 [14]}}