Edexcel D2 2019 June — Question 2 10 marks

Exam BoardEdexcel
ModuleD2 (Decision Mathematics 2)
Year2019
SessionJune
Marks10
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicNetwork Flows
TypeTransportation problem: stepping-stone method
DifficultyModerate -0.3 This is a standard algorithmic question testing the stepping-stone method with clear instructions at each stage. While it requires careful bookkeeping and multiple steps, it's a routine application of a prescribed algorithm with no problem-solving insight needed—students follow the mechanical procedure they've been taught. The method is more tedious than conceptually difficult, making it slightly easier than average A-level maths questions.
Spec7.06f Integer programming: branch-and-bound method7.07f Algebraic interpretation: explain simplex calculations

2. Table 1 shows the cost, in pounds, of transporting one unit of stock from each of three supply points, \(\mathrm { A } , \mathrm { B }\) and C , to each of four demand points, 1, 2, 3 and 4 . It also shows the stock held at each supply point and the stock required at each demand point. A minimum cost solution is required. \begin{table}[h]
1234Supply
A1720231425
B1615192229
C1914111532
Demand28172318
\captionsetup{labelformat=empty} \caption{Table 1}
\end{table} Table 2 shows an initial solution given by the north-west corner method. \begin{table}[h]
1234
\(A\)25
\(B\)3179
\(C\)1418
\captionsetup{labelformat=empty} \caption{Table 2}
\end{table}
  1. Taking A4 as the entering cell, use the stepping-stone method to find an improved solution. Make your route clear.
  2. Taking the most negative improvement index to indicate the entering cell, use the stepping-stone method once to obtain an improved solution. You must make your method clear by stating your shadow costs, improvement indices, route, entering cell and exiting cell.
  3. Determine whether your current solution is optimal, giving a reason for your answer.
  4. State the cost of your current solution.

Question 2:
Part (a)
AnswerMarks Guidance
Answer/WorkingMarks Guidance
Correct initial tableau with \(\theta\) values: A: \(25-\theta\), col 4: \(\theta\); B: \(3+\theta\), (17), \(9-\theta\); C: \(14+\theta\), \(18-\theta\)M1 A1 (2) Shadow costs 17, 16, 10, 14; improvement indices giving A col4: 9, B: 12, 17; C col3: 23, col4: 9
Part (b)
AnswerMarks Guidance
Answer/WorkingMarks Guidance
Updated tableau: A: \(16-\theta\), \(9+\theta\); B: \(12+\theta\), \(17-\theta\); C: \(\theta\), (23), \(9-\theta\)M1
Entering cell C2, Exiting cell C4A1 (4) Shadow costs 17, 16, 13, 14; indices: A col4: 18, B col2: 21, col3: 8, C col3: 9, col4: 23
Part (c)
AnswerMarks Guidance
Answer/WorkingMarks Guidance
Updated tableau with shadow costs 17, 16, 13, 14; improvement indices: A col2: X, col3: 4, col4: X; B col2: X, col3: 7, col4: 9; C col2: 4, col3: X, col4: 3M1 A1
Optimal as there are no negative improvement indicesA1 (3)
Part (d)
AnswerMarks Guidance
Answer/WorkingMarks Guidance
Cost \(= £1206\)B1 (1)
Total: 10 marks
# Question 2:

## Part (a)
| Answer/Working | Marks | Guidance |
|---|---|---|
| Correct initial tableau with $\theta$ values: A: $25-\theta$, col 4: $\theta$; B: $3+\theta$, (17), $9-\theta$; C: $14+\theta$, $18-\theta$ | M1 A1 (2) | Shadow costs 17, 16, 10, 14; improvement indices giving A col4: 9, B: 12, 17; C col3: 23, col4: 9 |

## Part (b)
| Answer/Working | Marks | Guidance |
|---|---|---|
| Updated tableau: A: $16-\theta$, $9+\theta$; B: $12+\theta$, $17-\theta$; C: $\theta$, (23), $9-\theta$ | M1 | |
| **Entering cell C2, Exiting cell C4** | A1 (4) | Shadow costs 17, 16, 13, 14; indices: A col4: 18, B col2: 21, col3: 8, C col3: 9, col4: 23 |

## Part (c)
| Answer/Working | Marks | Guidance |
|---|---|---|
| Updated tableau with shadow costs 17, 16, 13, 14; improvement indices: A col2: X, col3: 4, col4: X; B col2: X, col3: 7, col4: 9; C col2: 4, col3: X, col4: 3 | M1 A1 | |
| Optimal as there are no negative improvement indices | A1 (3) | |

## Part (d)
| Answer/Working | Marks | Guidance |
|---|---|---|
| Cost $= £1206$ | B1 (1) | |

**Total: 10 marks**
2. Table 1 shows the cost, in pounds, of transporting one unit of stock from each of three supply points, $\mathrm { A } , \mathrm { B }$ and C , to each of four demand points, 1, 2, 3 and 4 . It also shows the stock held at each supply point and the stock required at each demand point. A minimum cost solution is required.

\begin{table}[h]
\begin{center}
\begin{tabular}{|l|l|l|l|l|l|}
\hline
 & 1 & 2 & 3 & 4 & Supply \\
\hline
A & 17 & 20 & 23 & 14 & 25 \\
\hline
B & 16 & 15 & 19 & 22 & 29 \\
\hline
C & 19 & 14 & 11 & 15 & 32 \\
\hline
Demand & 28 & 17 & 23 & 18 &  \\
\hline
\end{tabular}
\captionsetup{labelformat=empty}
\caption{Table 1}
\end{center}
\end{table}

Table 2 shows an initial solution given by the north-west corner method.

\begin{table}[h]
\begin{center}
\begin{tabular}{ | c | c | c | c | c | }
\hline
 & 1 & 2 & 3 & 4 \\
\hline
$A$ & 25 &  &  &  \\
\hline
$B$ & 3 & 17 & 9 &  \\
\hline
$C$ &  &  & 14 & 18 \\
\hline
\end{tabular}
\captionsetup{labelformat=empty}
\caption{Table 2}
\end{center}
\end{table}
\begin{enumerate}[label=(\alph*)]
\item Taking A4 as the entering cell, use the stepping-stone method to find an improved solution. Make your route clear.
\item Taking the most negative improvement index to indicate the entering cell, use the stepping-stone method once to obtain an improved solution. You must make your method clear by stating your shadow costs, improvement indices, route, entering cell and exiting cell.
\item Determine whether your current solution is optimal, giving a reason for your answer.
\item State the cost of your current solution.
\end{enumerate}

\hfill \mbox{\textit{Edexcel D2 2019 Q2 [10]}}