Edexcel FD1 2024 June — Question 7 14 marks

Exam BoardEdexcel
ModuleFD1 (Further Decision 1)
Year2024
SessionJune
Marks14
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicLinear Programming
TypeSimplex tableau interpretation
DifficultyStandard +0.3 This is a standard Simplex algorithm question requiring routine tableau interpretation and row operations. While it involves multiple parts and fractional arithmetic, the techniques are mechanical and follow prescribed procedures taught in FD1. No novel problem-solving or insight is required—students apply learned algorithms step-by-step.
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. A maximisation linear programming problem in \(x , y\) and \(z\) is to be solved using the Simplex method. The tableau after the 1st iteration is shown below.
b.v.\(x\)\(y\)\(z\)\(s _ { 1 }\)\(S _ { 2 }\)\(S _ { 3 }\)Value
\(s _ { 1 }\)0\(- \frac { 1 } { 2 }\)\(\frac { 3 } { 2 }\)1\(- \frac { 1 } { 2 }\)030
\(x\)1\(\frac { 1 } { 4 }\)\(- \frac { 1 } { 4 }\)0\(\frac { 1 } { 4 }\)010
\(S _ { 3 }\)01100126
\(P\)0\(- \frac { 1 } { 4 }\)\(- \frac { 11 } { 4 }\)0\(\frac { 3 } { 4 }\)030
  1. State the column that contains the pivot value for the 1st iteration. You must give a reason for your answer.
  2. By considering the equations represented in the above tableau, formulate the linear programming problem in \(x , y\) and \(z\) only. State the objective and list the constraints as inequalities with integer coefficients.
  3. Taking the most negative number in the profit row to indicate the pivot column, perform the 2nd iteration of the Simplex algorithm, to obtain a new tableau, T . Make your method clear by stating the row operations you use.
    1. Explain, using T, how you know that an optimal solution to the original linear programming problem has not been found after the 2nd iteration.
    2. State the values of the basic variables after the 2nd iteration. A student attempts the 3rd iteration of the Simplex algorithm and obtains the tableau below.
      b.v.\(x\)\(y\)\(z\)\(s _ { 1 }\)\(S _ { 2 }\)\(\mathrm { S } _ { 3 }\)Value
      z001\(\frac { 1 } { 2 }\)\(- \frac { 1 } { 4 }\)\(\frac { 1 } { 4 }\)\(\frac { 43 } { 2 }\)
      \(x\)100\(\frac { 1 } { 4 }\)\(\frac { 1 } { 8 }\)\(- \frac { 1 } { 8 }\)\(\frac { 57 } { 4 }\)
      \(y\)010\(- \frac { 1 } { 2 }\)\(\frac { 1 } { 4 }\)\(\frac { 3 } { 4 }\)\(\frac { 9 } { 2 }\)
      \(P\)010\(\frac { 5 } { 4 }\)\(\frac { 1 } { 8 }\)\(\frac { 7 } { 8 }\)\(\frac { 361 } { 4 }\)
  4. Explain how you know that the student's attempt at the 3rd iteration is not correct.

Question 7:
Part (a)
AnswerMarks Guidance
AnswerMark Guidance
The pivot for this first iteration came from the \(x\)-columnB1 AO1.1b
…as \(x\) is now a basic variabledB1 AO2.5; dependent on B1
Part (b)
AnswerMarks Guidance
AnswerMark Guidance
\(x\)-row: \(4x + y - z \leq 40\) or \(s_3\)-row: \(y + z \leq 26\)B1 AO3.4
Eliminating \(s_2\) from \(s_1\) row using \(x\) row: \(-\frac{1}{2}y + \frac{3}{2}z + s_1 - 2\!\left(10 - x - \frac{1}{4}y + \frac{1}{4}z\right) = 30\)M1 AO2.1
Eliminating \(s_2\) from \(P\) row using \(x\) row: \(P - \frac{1}{4}y - \frac{11}{4}z + 3\!\left(10 - x - \frac{1}{4}y + \frac{1}{4}z\right) = 30\)M1 AO1.1b
\(P - 3x - y - 2z = 0\) or \(2x + z + s_1 = 50\)A1 AO1.1b
LP: Maximise \(P = 3x + y + 2z\), subject to \(2x + z \leq 50\), \(4x + y - z \leq 40\), \(y + z \leq 26\), \((x, y, z \geq 0)\)A1 AO2.2a
Question 7:
Part (a)
AnswerMarks Guidance
AnswerMark Guidance
Correct column of \(x\) statedB1 CAO
\(x\) is now a basic variable; \(x\) column has one 1 and rest 0, or \(s_2\) row has been replaced with \(x\)dB1 Dependent on first B1
Part (b)
AnswerMarks Guidance
AnswerMark Guidance
Either constraint for \(x\)-row or \(s_3\)-row correct (inequalities, not strict)B1 Allow non-integer coefficients
Eliminating \(s_2\) from \(s_1\) row equation using \(x\) rowM1 Correct constraint implies this mark
Eliminating \(s_2\) from \(P\) row using \(x\) rowM1 Correct objective implies this mark
\(P - 3x - y - 2z = 0\) or \(2x + z + s_1 = 50\)A1 Allow equivalent forms with non-integer coefficients, simplified to single term per variable
Correct LP formulationA1 Condone lack of 'maximise' and non-negative trivial constraints
Part (c)
AnswerMarks Guidance
AnswerMark Guidance
Pivot row completely correct including change of b.v.B1 Accept correct recurring decimals in place of fractions
All values in one non-pivot row correct, or one of the 'non zero and one' columns (\(y, s_1, s_2\) or Value) correctM1 Must have pivoted on correct value
All values correct including b.v. columnA1 Ignore 'Row Ops' column
Correct row operations statedB1 Allow alternative row numbering; condone use of \(R_1\) throughout
Second iteration tableau:
AnswerMarks Guidance
b.v.\(x\) \(y\)
\(z\)\(0\) \(-\frac{1}{3}\)
\(x\)\(1\) \(\frac{1}{6}\)
\(s_3\)\(0\) \(\frac{4}{3}\)
\(P\)\(0\) \(-\frac{7}{6}\)
(4 marks)
Part (d)(i)
AnswerMarks Guidance
AnswerMark Guidance
After second iteration optimal solution not found as profit row still contains negative valuesdB1 CAO; dependent on M mark in (c) and completed profit row; do not accept "not all values are positive"
Part (d)(ii)
AnswerMarks Guidance
AnswerMark Guidance
\(z = 20,\ x = 15,\ s_3 = 6\)dB1ft Follow through on their values; dependent on M mark in (c); all values must be positive
(2 marks)
Part (e)
AnswerMarks Guidance
AnswerMark Guidance
If \(y\) is a basic variable, the \(y\) column should contain only one value of 1 (in the third row), therefore the entry of 1 in the profit row is incorrect (should be 0)B1 CAO; accept: there should not be a 1 in the objective row in the \(y\) column, or there should not be two 1s in the \(y\) column. If \(s_2\) column also mentioned then B0
(1 mark)
Total: 14 marks
# Question 7:

## Part (a)
| Answer | Mark | Guidance |
|--------|------|----------|
| The pivot for this first iteration came from the $x$-column | B1 | AO1.1b |
| …as $x$ is now a basic variable | dB1 | AO2.5; dependent on B1 |

## Part (b)
| Answer | Mark | Guidance |
|--------|------|----------|
| $x$-row: $4x + y - z \leq 40$ **or** $s_3$-row: $y + z \leq 26$ | B1 | AO3.4 |
| Eliminating $s_2$ from $s_1$ row using $x$ row: $-\frac{1}{2}y + \frac{3}{2}z + s_1 - 2\!\left(10 - x - \frac{1}{4}y + \frac{1}{4}z\right) = 30$ | M1 | AO2.1 |
| Eliminating $s_2$ from $P$ row using $x$ row: $P - \frac{1}{4}y - \frac{11}{4}z + 3\!\left(10 - x - \frac{1}{4}y + \frac{1}{4}z\right) = 30$ | M1 | AO1.1b |
| $P - 3x - y - 2z = 0$ **or** $2x + z + s_1 = 50$ | A1 | AO1.1b |
| LP: Maximise $P = 3x + y + 2z$, subject to $2x + z \leq 50$, $4x + y - z \leq 40$, $y + z \leq 26$, $(x, y, z \geq 0)$ | A1 | AO2.2a |

# Question 7:

## Part (a)

| Answer | Mark | Guidance |
|--------|------|----------|
| Correct column of $x$ stated | B1 | CAO |
| $x$ is now a basic variable; $x$ column has one 1 and rest 0, or $s_2$ row has been replaced with $x$ | dB1 | Dependent on first B1 |

## Part (b)

| Answer | Mark | Guidance |
|--------|------|----------|
| Either constraint for $x$-row or $s_3$-row correct (inequalities, not strict) | B1 | Allow non-integer coefficients |
| Eliminating $s_2$ from $s_1$ row equation using $x$ row | M1 | Correct constraint implies this mark |
| Eliminating $s_2$ from $P$ row using $x$ row | M1 | Correct objective implies this mark |
| $P - 3x - y - 2z = 0$ **or** $2x + z + s_1 = 50$ | A1 | Allow equivalent forms with non-integer coefficients, simplified to single term per variable |
| Correct LP formulation | A1 | Condone lack of 'maximise' and non-negative trivial constraints |

## Part (c)

| Answer | Mark | Guidance |
|--------|------|----------|
| Pivot row completely correct including change of b.v. | B1 | Accept correct recurring decimals in place of fractions |
| All values in one non-pivot row correct, or one of the 'non zero and one' columns ($y, s_1, s_2$ or Value) correct | M1 | Must have pivoted on correct value |
| All values correct including b.v. column | A1 | Ignore 'Row Ops' column |
| Correct row operations stated | B1 | Allow alternative row numbering; condone use of $R_1$ throughout |

**Second iteration tableau:**

| b.v. | $x$ | $y$ | $z$ | $s_1$ | $s_2$ | $s_3$ | Value | Row Ops |
|------|-----|-----|-----|--------|--------|--------|-------|---------|
| $z$ | $0$ | $-\frac{1}{3}$ | $1$ | $\frac{2}{3}$ | $-\frac{1}{3}$ | $0$ | $20$ | $\frac{2}{3}r1$ |
| $x$ | $1$ | $\frac{1}{6}$ | $0$ | $\frac{1}{6}$ | $\frac{1}{6}$ | $0$ | $15$ | $r2 + 0.25R1$ |
| $s_3$ | $0$ | $\frac{4}{3}$ | $0$ | $-\frac{2}{3}$ | $\frac{1}{3}$ | $1$ | $6$ | $r3 - R1$ |
| $P$ | $0$ | $-\frac{7}{6}$ | $0$ | $\frac{11}{6}$ | $-\frac{1}{6}$ | $0$ | $85$ | $r4 + 2.75R1$ |

**(4 marks)**

## Part (d)(i)

| Answer | Mark | Guidance |
|--------|------|----------|
| After second iteration optimal solution not found as profit row still contains negative values | dB1 | CAO; dependent on M mark in (c) and completed profit row; do not accept "not all values are positive" |

## Part (d)(ii)

| Answer | Mark | Guidance |
|--------|------|----------|
| $z = 20,\ x = 15,\ s_3 = 6$ | dB1ft | Follow through on their values; dependent on M mark in (c); all values must be positive |

**(2 marks)**

## Part (e)

| Answer | Mark | Guidance |
|--------|------|----------|
| If $y$ is a basic variable, the $y$ column should contain only one value of 1 (in the third row), therefore the entry of 1 in the profit row is incorrect (should be 0) | B1 | CAO; accept: there should not be a 1 in the objective row in the $y$ column, or there should not be two 1s in the $y$ column. If $s_2$ column also mentioned then B0 |

**(1 mark)**

**Total: 14 marks**
7. A maximisation linear programming problem in $x , y$ and $z$ is to be solved using the Simplex method.

The tableau after the 1st iteration is shown below.

\begin{center}
\begin{tabular}{|l|l|l|l|l|l|l|l|}
\hline
b.v. & $x$ & $y$ & $z$ & $s _ { 1 }$ & $S _ { 2 }$ & $S _ { 3 }$ & Value \\
\hline
$s _ { 1 }$ & 0 & $- \frac { 1 } { 2 }$ & $\frac { 3 } { 2 }$ & 1 & $- \frac { 1 } { 2 }$ & 0 & 30 \\
\hline
$x$ & 1 & $\frac { 1 } { 4 }$ & $- \frac { 1 } { 4 }$ & 0 & $\frac { 1 } { 4 }$ & 0 & 10 \\
\hline
$S _ { 3 }$ & 0 & 1 & 1 & 0 & 0 & 1 & 26 \\
\hline
$P$ & 0 & $- \frac { 1 } { 4 }$ & $- \frac { 11 } { 4 }$ & 0 & $\frac { 3 } { 4 }$ & 0 & 30 \\
\hline
\end{tabular}
\end{center}
\begin{enumerate}[label=(\alph*)]
\item State the column that contains the pivot value for the 1st iteration. You must give a reason for your answer.
\item By considering the equations represented in the above tableau, formulate the linear programming problem in $x , y$ and $z$ only. State the objective and list the constraints as inequalities with integer coefficients.
\item Taking the most negative number in the profit row to indicate the pivot column, perform the 2nd iteration of the Simplex algorithm, to obtain a new tableau, T . Make your method clear by stating the row operations you use.
\item \begin{enumerate}[label=(\roman*)]
\item Explain, using T, how you know that an optimal solution to the original linear programming problem has not been found after the 2nd iteration.
\item State the values of the basic variables after the 2nd iteration.

A student attempts the 3rd iteration of the Simplex algorithm and obtains the tableau below.

\begin{center}
\begin{tabular}{|l|l|l|l|l|l|l|l|}
\hline
b.v. & $x$ & $y$ & $z$ & $s _ { 1 }$ & $S _ { 2 }$ & $\mathrm { S } _ { 3 }$ & Value \\
\hline
z & 0 & 0 & 1 & $\frac { 1 } { 2 }$ & $- \frac { 1 } { 4 }$ & $\frac { 1 } { 4 }$ & $\frac { 43 } { 2 }$ \\
\hline
$x$ & 1 & 0 & 0 & $\frac { 1 } { 4 }$ & $\frac { 1 } { 8 }$ & $- \frac { 1 } { 8 }$ & $\frac { 57 } { 4 }$ \\
\hline
$y$ & 0 & 1 & 0 & $- \frac { 1 } { 2 }$ & $\frac { 1 } { 4 }$ & $\frac { 3 } { 4 }$ & $\frac { 9 } { 2 }$ \\
\hline
$P$ & 0 & 1 & 0 & $\frac { 5 } { 4 }$ & $\frac { 1 } { 8 }$ & $\frac { 7 } { 8 }$ & $\frac { 361 } { 4 }$ \\
\hline
\end{tabular}
\end{center}
\end{enumerate}\item Explain how you know that the student's attempt at the 3rd iteration is not correct.
\end{enumerate}

\hfill \mbox{\textit{Edexcel FD1 2024 Q7 [14]}}