| Exam Board | Edexcel |
|---|---|
| Module | D2 (Decision Mathematics 2) |
| Marks | 10 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Matchings and Allocation |
| Type | Transportation problem: stepping-stone method |
| Difficulty | Moderate -0.3 This is a standard textbook transportation problem using well-defined algorithms (north-west corner method, shadow costs, improvement indices). While it requires careful bookkeeping across multiple steps, each step follows a mechanical procedure with no novel insight or problem-solving required. The stepping-stone method is routine for D2 students, making this slightly easier than average. |
| Spec | 7.06b Slack variables: converting inequalities to equations7.06c Working with constraints: algebra and ad hoc methods7.06d Graphical solution: feasible region, two variables |
| \backslashbox{Branches with spare cars}{Branches needing cars} | \(D\) | \(E\) | \(F\) | Available |
| \(A\) | 6 | 4 | 7 | 7 |
| B | 8 | 5 | 3 | 8 |
| C | 4 | 4 | 2 | 5 |
| Required | 5 | 9 | 6 |
5. A car-hire firm has six branches in a region. Three of the branches, $A , B$ and $C$, have spare cars, whereas the other three, $D , E$ and $F$, require cars. The total number of cars required is equal to the number of cars available. The table below shows the cost in pounds of sending one car from each branch with spares to each branch needing more cars and the number of cars available or required by each branch.
\begin{center}
\begin{tabular}{|l|l|l|l|l|}
\hline
\backslashbox{Branches with spare cars}{Branches needing cars} & $D$ & $E$ & $F$ & Available \\
\hline
$A$ & 6 & 4 & 7 & 7 \\
\hline
B & 8 & 5 & 3 & 8 \\
\hline
C & 4 & 4 & 2 & 5 \\
\hline
Required & 5 & 9 & 6 & \\
\hline
\end{tabular}
\end{center}
\begin{enumerate}[label=(\alph*)]
\item Use the north-west corner method to obtain a possible pattern of moving cars and find its cost.
The firm wishes to minimise the cost of redistributing the cars.
\item Calculate shadow costs for the pattern found in part (a) and improvement indices for each unoccupied cell.
\item State, with a reason, whether or not the pattern found in part (a) is optimal.
\end{enumerate}
\hfill \mbox{\textit{Edexcel D2 Q5 [10]}}