Edexcel D1 2001 June — Question 7 17 marks

Exam BoardEdexcel
ModuleD1 (Decision Mathematics 1)
Year2001
SessionJune
Marks17
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicThe Simplex Algorithm
TypeComplete Simplex solution
DifficultyModerate -0.3 This is a standard textbook Simplex algorithm question with explicit instructions on which variables to pivot at each iteration. While it requires careful arithmetic and understanding of the method, it involves no problem-solving or decision-making since the pivot choices are given. The explanation parts are routine recall of Simplex concepts. Slightly easier than average due to the guided nature.
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 objective

7. This question is to be answered on the sheet provided in the answer booklet. A chemical company makes 3 products \(X , Y\) and \(Z\). It wishes to maximise its profit \(\pounds P\). The manager considers the limitations on the raw materials available and models the situation with the following Linear Programming problem. Maximise $$\begin{gathered} P = 3 x + 6 y + 4 z \\ x \quad + \quad z \leq 4 \\ x + 4 y + 2 z \leq 6 \\ x + y + 2 z \leq 12 \\ x \geq 0 , \quad y \geq 0 , \quad z \geq 0 \end{gathered}$$ subject to
where \(x , y\) and \(z\) are the weights, in kg , of products \(X , Y\) and \(Z\) respectively.
A possible initial tableau is
Basic variable\(x\)\(y\)\(z\)\(r\)\(s\)\(t\)Value
\(r\)1011004
\(s\)1420106
\(t\)11200112
\(P\)- 3- 6- 40000
  1. Explain
    1. the purpose of the variables \(r , s\) and \(t\),
    2. the final row of the tableau.
  2. Solve this Linear Programming problem by using the Simplex alogorithm. Increase \(y\) for your first iteration and than increase \(x\) for your second iteration.
  3. Interpret your solution.

Question 7:
Part (a)(i):
AnswerMarks Guidance
Answer/WorkingMarks Guidance
Slack variables used to enable us to write inequalities as equalities, all \(\geq 0\)M1 A1
Part (a)(ii):
AnswerMarks Guidance
Answer/WorkingMarks Guidance
\(P - 3x - 6y - 4z = 0\)B1 (3)
Part (b):
AnswerMarks Guidance
Answer/WorkingMarks Guidance
Initial tableau set up correctlyM1
\(R_2 \div 4\) performed correctlyA1 (R2)
Pivot operation \(R_3 - R_2\)M1
Row reduction correctA1
\(R_4 + 6R_2\)A1
A1ft (pivot)
Second pivot: \(R_2 - \frac{1}{4}R_1\)M1 A1
\(R_3 - \frac{3}{4}R_1\)A1
\(R_4 + \frac{3}{2}R_1\)A1 (10)
Part (c):
AnswerMarks Guidance
Answer/WorkingMarks Guidance
Maximum profit is \(£15\)M1 A1ft
when \(x = 4\) kg, \(y = \frac{1}{2}\) kg, \(z = 0\) kgA1ft
The first and second constraints have no slackB1ft
There is a slack of \(7\frac{1}{2}\) in the third constraint (4)
## Question 7:

### Part (a)(i):

| Answer/Working | Marks | Guidance |
|---|---|---|
| Slack variables used to enable us to write inequalities as equalities, all $\geq 0$ | M1 A1 | |

### Part (a)(ii):

| Answer/Working | Marks | Guidance |
|---|---|---|
| $P - 3x - 6y - 4z = 0$ | B1 | **(3)** |

### Part (b):

| Answer/Working | Marks | Guidance |
|---|---|---|
| Initial tableau set up correctly | M1 | |
| $R_2 \div 4$ performed correctly | A1 (R2) | |
| Pivot operation $R_3 - R_2$ | M1 | |
| Row reduction correct | A1 | |
| $R_4 + 6R_2$ | A1 | |
| A1ft (pivot) | | |
| Second pivot: $R_2 - \frac{1}{4}R_1$ | M1 | A1 |
| $R_3 - \frac{3}{4}R_1$ | A1 | |
| $R_4 + \frac{3}{2}R_1$ | A1 | **(10)** |

### Part (c):

| Answer/Working | Marks | Guidance |
|---|---|---|
| Maximum profit is $£15$ | M1 A1ft | |
| when $x = 4$ kg, $y = \frac{1}{2}$ kg, $z = 0$ kg | A1ft | |
| The first and second constraints have no slack | B1ft | |
| There is a slack of $7\frac{1}{2}$ in the third constraint | | **(4)** |

---
7. This question is to be answered on the sheet provided in the answer booklet.

A chemical company makes 3 products $X , Y$ and $Z$. It wishes to maximise its profit $\pounds P$. The manager considers the limitations on the raw materials available and models the situation with the following Linear Programming problem.

Maximise

$$\begin{gathered}
P = 3 x + 6 y + 4 z \\
x \quad + \quad z \leq 4 \\
x + 4 y + 2 z \leq 6 \\
x + y + 2 z \leq 12 \\
x \geq 0 , \quad y \geq 0 , \quad z \geq 0
\end{gathered}$$

subject to\\
where $x , y$ and $z$ are the weights, in kg , of products $X , Y$ and $Z$ respectively.\\
A possible initial tableau is

\begin{center}
\begin{tabular}{ | c | c | c | c | c | c | c | c | }
\hline
Basic variable & $x$ & $y$ & $z$ & $r$ & $s$ & $t$ & Value \\
\hline
$r$ & 1 & 0 & 1 & 1 & 0 & 0 & 4 \\
\hline
$s$ & 1 & 4 & 2 & 0 & 1 & 0 & 6 \\
\hline
$t$ & 1 & 1 & 2 & 0 & 0 & 1 & 12 \\
\hline
$P$ & - 3 & - 6 & - 4 & 0 & 0 & 0 & 0 \\
\hline
\end{tabular}
\end{center}
\begin{enumerate}[label=(\alph*)]
\item Explain
\begin{enumerate}[label=(\roman*)]
\item the purpose of the variables $r , s$ and $t$,
\item the final row of the tableau.
\end{enumerate}\item Solve this Linear Programming problem by using the Simplex alogorithm. Increase $y$ for your first iteration and than increase $x$ for your second iteration.
\item Interpret your solution.
\end{enumerate}

\hfill \mbox{\textit{Edexcel D1 2001 Q7 [17]}}