Edexcel FD2 2024 June — Question 3 12 marks

Exam BoardEdexcel
ModuleFD2 (Further Decision 2)
Year2024
SessionJune
Marks12
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicMatchings and Allocation
TypeTransportation problem: stepping-stone method
DifficultyChallenging +1.2 This is a standard transportation problem using the stepping-stone method, a routine algorithmic procedure taught in FD2. While it requires careful bookkeeping across multiple iterations and understanding of dummy variables, it follows a mechanical process with no novel problem-solving or insight required. The multi-part structure and iteration tracking make it moderately above average difficulty, but it remains a textbook application of a learned algorithm.
Spec7.06a LP formulation: variables, constraints, objective function7.06b Slack variables: converting inequalities to equations7.06c Working with constraints: algebra and ad hoc methods

3. The table below shows the cost, in pounds, of transporting one unit of stock from each of four supply points, \(\mathrm { E } , \mathrm { F } , \mathrm { G }\) and H , to three sales points, \(\mathrm { A } , \mathrm { B }\) and C . It also shows the stock held at each supply point and the amount required at each sales point.
A minimum cost solution is required.
ABCSupply
E23282221
F26192932
G29242029
H24261923
Demand451923
  1. Explain why it is necessary to add a dummy demand point.
  2. On Table 1 in the answer book, insert appropriate values in the dummy demand column, D. After finding an initial feasible solution and applying one iteration of the stepping-stone method, the table becomes
    \(A\)\(B\)\(C\)\(D\)
    \(E\)21
    \(F\)1913
    \(G\)623
    \(H\)518
  3. Starting with GD as the next entering cell, perform two further iterations of the stepping-stone method to obtain an improved solution. You must make your method clear by showing your routes and stating the

Question 3:
Part (a)
AnswerMarks Guidance
AnswerMark Guidance
(total) demand \(\neq\) (total) supplyB1 CAO (or to make demand = supply or because (total) supply > (total) demand). Accept e.g. "A dummy demand of 18 is needed to meet supply" or "there is a total of 105 supply but only 87 demand"
Part (b)
AnswerMarks Guidance
AnswerMark Guidance
Table with Dummy column having demand 18 and all zero costs for E, F, G, HB1 CAO. Check 18 in demand row
Part (c)
AnswerMarks Guidance
AnswerMark Guidance
Valid route, only one empty square (GD) used, \(\theta\)s balanceM1
Correct route, up to an improved solution (seven numbers, no zeros). Exiting cell is GBA1
Finding 8 shadow costs and 9 improvement indicesM1
Shadow costs and II correct (alternatives: columns \(0, -7, -4, -24\); rows \(23, 26, 24, 24\))A1
Valid route, most negative II chosen, only one empty square used, \(\theta\)s balanceM1
CSO: entering cell FD, exiting cell HD; up to improved solution (seven numbers, no zeros)A1 For part (c) so all previous marks in this part must have been awarded
Part (d)
AnswerMarks Guidance
AnswerMark Guidance
\((\pounds)1882\)B1 CAO
Part (e)
AnswerMarks Guidance
AnswerMark Guidance
Finding 8 shadow costs and all 9 improvement indices (or 8 SC and at least 1 negative II)M1
CAO for shadow costs and the 9 improvement indices (alternatives: columns \(0, -7, -6, -26\); rows \(23, 26, 26, 24\))A1
All II are non-negative so solution is optimalA1 CSO (for part (e)) + reason + optimal; accept "positive" instead of "non-negative"
# Question 3:

## Part (a)
| Answer | Mark | Guidance |
|--------|------|----------|
| (total) demand $\neq$ (total) supply | B1 | CAO (or to make demand = supply or because (total) supply > (total) demand). Accept e.g. "A dummy demand of 18 is needed to meet supply" or "there is a total of 105 supply but only 87 demand" |

## Part (b)
| Answer | Mark | Guidance |
|--------|------|----------|
| Table with Dummy column having demand 18 and all zero costs for E, F, G, H | B1 | CAO. Check 18 in demand row |

## Part (c)
| Answer | Mark | Guidance |
|--------|------|----------|
| Valid route, only one empty square (GD) used, $\theta$s balance | M1 | |
| Correct route, up to an improved solution (seven numbers, no zeros). Exiting cell is GB | A1 | |
| Finding 8 shadow costs and 9 improvement indices | M1 | |
| Shadow costs and II correct (alternatives: columns $0, -7, -4, -24$; rows $23, 26, 24, 24$) | A1 | |
| Valid route, most negative II chosen, only one empty square used, $\theta$s balance | M1 | |
| CSO: entering cell FD, exiting cell HD; up to improved solution (seven numbers, no zeros) | A1 | For part (c) so all previous marks in this part must have been awarded |

## Part (d)
| Answer | Mark | Guidance |
|--------|------|----------|
| $(\pounds)1882$ | B1 | CAO |

## Part (e)
| Answer | Mark | Guidance |
|--------|------|----------|
| Finding 8 shadow costs and all 9 improvement indices (or 8 SC and at least 1 negative II) | M1 | |
| CAO for shadow costs and the 9 improvement indices (alternatives: columns $0, -7, -6, -26$; rows $23, 26, 26, 24$) | A1 | |
| All II are non-negative so solution is optimal | A1 | CSO (for part (e)) + reason + optimal; accept "positive" instead of "non-negative" |
3. The table below shows the cost, in pounds, of transporting one unit of stock from each of four supply points, $\mathrm { E } , \mathrm { F } , \mathrm { G }$ and H , to three sales points, $\mathrm { A } , \mathrm { B }$ and C . It also shows the stock held at each supply point and the amount required at each sales point.\\
A minimum cost solution is required.

\begin{center}
\begin{tabular}{ | c | c | c | c | c | }
\hline
 & A & B & C & Supply \\
\hline
E & 23 & 28 & 22 & 21 \\
\hline
F & 26 & 19 & 29 & 32 \\
\hline
G & 29 & 24 & 20 & 29 \\
\hline
H & 24 & 26 & 19 & 23 \\
\hline
Demand & 45 & 19 & 23 &  \\
\hline
\end{tabular}
\end{center}
\begin{enumerate}[label=(\alph*)]
\item Explain why it is necessary to add a dummy demand point.
\item On Table 1 in the answer book, insert appropriate values in the dummy demand column, D.

After finding an initial feasible solution and applying one iteration of the stepping-stone method, the table becomes

\begin{center}
\begin{tabular}{ | c | c | c | c | c | }
\hline
 & $A$ & $B$ & $C$ & $D$ \\
\hline
$E$ & 21 &  &  &  \\
\hline
$F$ & 19 & 13 &  &  \\
\hline
$G$ &  & 6 & 23 &  \\
\hline
$H$ & 5 &  &  & 18 \\
\hline
\end{tabular}
\end{center}
\item Starting with GD as the next entering cell, perform two further iterations of the stepping-stone method to obtain an improved solution. You must make your method clear by showing your routes and stating the

\begin{itemize}
  \item shadow costs
  \item improvement indices
  \item entering and exiting cells
\item State the cost of the solution found in (c).
\item Determine whether the solution obtained in (c) is optimal, giving a reason for your answer.
\end{itemize}
\end{enumerate}

\hfill \mbox{\textit{Edexcel FD2 2024 Q3 [12]}}