| Exam Board | Edexcel |
|---|---|
| Module | D2 (Decision Mathematics 2) |
| Year | 2010 |
| Session | June |
| Marks | 13 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | The Simplex Algorithm |
| Type | Complete Simplex solution |
| Difficulty | Standard +0.3 This is a standard Simplex algorithm question requiring mechanical application of the pivot procedure. Students follow a prescribed method (most negative in profit row), perform row operations, and read off the solution. While it requires careful arithmetic and organization, it involves no problem-solving insight or novel thinking—just executing a learned algorithm with multiple steps. |
| Spec | 7.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 |
| Basic Variable | \(x\) | \(y\) | \(z\) | \(r\) | \(s\) | \(t\) | Value |
| \(r\) | 0 | 1 | 2 | 1 | 0 | 0 | 24 |
| \(s\) | 2 | 1 | 4 | 0 | 1 | 0 | 28 |
| \(t\) | -1 | \(\frac { 1 } { 2 }\) | 3 | 0 | 0 | 1 | 22 |
| \(P\) | -1 | -2 | -6 | 0 | 0 | 0 | 0 |
| Answer | Marks | Guidance |
|---|---|---|
| \(P - x - 2y - 6z = 0\) | B1 | (1) |
| Answer | Marks | Guidance |
|---|---|---|
| Correct pivot located, attempt to divide row | M1 | |
| pivot row correct including change of b.v. | A1 | |
| Correct row operations used at least once or stated correctly | M1 | |
| Looking at non zero-and-one columns, one column ft correct | A1ft | |
| cao | A1 | (5) |
| Answer | Marks |
|---|---|
| \[\begin{array}{c | ccccccc} |
| Answer | Marks | Guidance |
|---|---|---|
| Row ops: \(R_1 - 2R_2\), \(R_2 \div 4\), \(R_3 - 3R_2\), \(R_4 + 6R_2\) | M1, A1ft, A1 | |
| (ft) Correct pivot identified – negative pivot gets M0 M0 | M1 | |
| ft pivot row correct including change of bv | A1 | (4) |
| Answer | Marks |
|---|---|
| \[\begin{array}{c | ccccccc} |
| Answer | Marks |
|---|---|
| Row ops: \(R_1 \div \frac{1}{2}\), \(R_2 - \frac{1}{4}R_1\), \(R_3 + \frac{1}{4}R_1\), \(R_4 + \frac{1}{2}R_1\) | M1, A1ft, M1, A1 |
| Answer | Marks | Guidance |
|---|---|---|
| \(P=52\), \(x=0\), \(y=20\), \(z=2\), \(r=0\), \(s=0\), \(t=6\) | M1, A1ft, A1 | (3) At least 4 values stated; no negatives |
# Question 6:
## Part (a)
$P - x - 2y - 6z = 0$ | B1 | (1)
## Part (b) – First Tableau pivot:
Correct pivot located, attempt to divide row | M1 |
pivot row correct including change of b.v. | A1 |
Correct row operations used at least once or stated correctly | M1 |
Looking at non zero-and-one columns, one column ft correct | A1ft |
cao | A1 | (5)
Second tableau:
$$\begin{array}{c|ccccccc}
\text{b.v.} & x & y & z & r & s & t & \text{Value} \\ \hline
r & -1 & \frac{1}{2} & 0 & 1 & -\frac{1}{2} & 0 & 10 \\
z & \frac{1}{2} & \frac{1}{4} & 1 & 0 & \frac{1}{4} & 0 & 7 \\
t & -\frac{5}{2} & -\frac{1}{4} & 0 & 0 & -\frac{3}{4} & 1 & 1 \\
P & 2 & -\frac{1}{2} & 0 & 0 & \frac{3}{2} & 0 & 42
\end{array}$$
Row ops: $R_1 - 2R_2$, $R_2 \div 4$, $R_3 - 3R_2$, $R_4 + 6R_2$ | M1, A1ft, A1 |
(ft) Correct pivot identified – negative pivot gets M0 M0 | M1 |
ft pivot row correct including change of bv | A1 | (4)
Third tableau:
$$\begin{array}{c|ccccccc}
\text{b.v.} & x & y & z & r & s & t & \text{Value} \\ \hline
y & -2 & 1 & 0 & 2 & -1 & 0 & 20 \\
z & 1 & 0 & 1 & -\frac{1}{2} & \frac{1}{2} & 0 & 2 \\
t & -3 & 0 & 0 & \frac{1}{2} & -1 & 1 & 6 \\
P & 1 & 0 & 0 & 1 & 1 & 0 & 52
\end{array}$$
Row ops: $R_1 \div \frac{1}{2}$, $R_2 - \frac{1}{4}R_1$, $R_3 + \frac{1}{4}R_1$, $R_4 + \frac{1}{2}R_1$ | M1, A1ft, M1, A1 |
## Part (c)
$P=52$, $x=0$, $y=20$, $z=2$, $r=0$, $s=0$, $t=6$ | M1, A1ft, A1 | (3) At least 4 values stated; no negatives
---
6. The tableau below is the initial tableau for a linear programming problem in $x , y$ and $z$. The objective is to maximise the profit, $P$.
\begin{center}
\begin{tabular}{|l|l|l|l|l|l|l|l|}
\hline
Basic Variable & $x$ & $y$ & $z$ & $r$ & $s$ & $t$ & Value \\
\hline
$r$ & 0 & 1 & 2 & 1 & 0 & 0 & 24 \\
\hline
$s$ & 2 & 1 & 4 & 0 & 1 & 0 & 28 \\
\hline
$t$ & -1 & $\frac { 1 } { 2 }$ & 3 & 0 & 0 & 1 & 22 \\
\hline
$P$ & -1 & -2 & -6 & 0 & 0 & 0 & 0 \\
\hline
\end{tabular}
\end{center}
\begin{enumerate}[label=(\alph*)]
\item Write down the profit equation represented in the initial tableau.\\
(1)
\item Taking the most negative number in the profit row to indicate the pivot column at each stage, solve this linear programming problem. Make your method clear by stating the row operations you use.
\item State the final value of the objective function and of each variable.\\
(3)
\end{enumerate}
\hfill \mbox{\textit{Edexcel D2 2010 Q6 [13]}}