| Exam Board | Edexcel |
|---|---|
| Module | D2 (Decision Mathematics 2) |
| Year | 2016 |
| Session | June |
| Marks | 12 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Network Flows |
| Type | Transportation problem: add dummy |
| Difficulty | Moderate -0.5 This is a standard transportation problem with routine application of textbook algorithms (dummy demand, north-west corner, stepping-stone method). While multi-part with several marks, it requires only methodical execution of learned procedures with no novel insight or problem-solving—slightly easier than average due to its algorithmic nature. |
| Spec | 7.03l Bin packing: next-fit, first-fit, first-fit decreasing, full bin |
| A | B | C | Supply | |
| 1 | 18 | 23 | 20 | 15 |
| 2 | 22 | 17 | 25 | 36 |
| 3 | 24 | 21 | 19 | 28 |
| 4 | 21 | 22 | 17 | 20 |
| Demand | 40 | 20 | 25 |
| A | B | C | D | |
| 1 | 15 | |||
| 2 | 19 | 17 | ||
| 3 | 3 | 25 | ||
| 4 | 6 | 14 |
| Answer | Marks |
|---|---|
| Total supply = \(15+36+28+20=99\); total demand = \(40+20+25=85\); supply exceeds demand so dummy needed | B1 |
| Answer | Marks |
|---|---|
| Add dummy column D with demand 14, all costs 0 | B1 |
| Answer | Marks |
|---|---|
| North-west corner: \(1A=15\), \(2A=25\), \(2B=11\)... (correct allocation following NW rule) | B1 |
| Answer | Marks |
|---|---|
| Shadow costs and improvement indices calculated | M1 A1 |
| Entering cell D3, route identified, exiting cell found | M1 A1 |
| Second iteration with new entering cell | M1 A1 |
| Answer | Marks |
|---|---|
| Calculate all improvement indices for non-basic cells | M1 A1 |
| All indices \(\geqslant 0\) therefore optimal | A1 |
## Question 5:
**(a)**
Total supply = $15+36+28+20=99$; total demand = $40+20+25=85$; supply exceeds demand so dummy needed | B1 |
**(b)**
Add dummy column D with demand 14, all costs 0 | B1 |
**(c)**
North-west corner: $1A=15$, $2A=25$, $2B=11$... (correct allocation following NW rule) | B1 |
**(d)**
Shadow costs and improvement indices calculated | M1 A1 |
Entering cell D3, route identified, exiting cell found | M1 A1 |
Second iteration with new entering cell | M1 A1 |
**(e)**
Calculate all improvement indices for non-basic cells | M1 A1 |
All indices $\geqslant 0$ therefore optimal | A1 |
I can see these are exam questions but I don't have the mark scheme document - I only have the question paper pages shown. The images show:
- **Question 6**: A game theory question (12 marks total) about a two-person zero-sum game
- **Question 7**: A dynamic programming question (15 marks total) about canoe production scheduling
**I cannot extract a mark scheme** from these images because they only contain the **question paper**, not the mark scheme. The mark scheme would be a separate document.
If you have the mark scheme document, please share those images and I can extract and format that content for you.
5. The table below shows the cost of transporting one unit of stock from each of four supply points, 1 , 2,3 and 4, to each of three demand points, A, B and C. It also shows the stock held at each supply point and the stock required at each demand point. A minimal cost solution is required.
\begin{center}
\begin{tabular}{ | c | c | c | c | c | }
\hline
& A & B & C & Supply \\
\hline
1 & 18 & 23 & 20 & 15 \\
\hline
2 & 22 & 17 & 25 & 36 \\
\hline
3 & 24 & 21 & 19 & 28 \\
\hline
4 & 21 & 22 & 17 & 20 \\
\hline
Demand & 40 & 20 & 25 & \\
\hline
\end{tabular}
\end{center}
\begin{enumerate}[label=(\alph*)]
\item Explain why it is necessary to add a dummy demand point.
\item Add a dummy demand point and appropriate values to Table 1 in the answer book.
\item Use the north-west corner method to obtain a possible solution.
After one iteration of the stepping-stone method the table becomes
\begin{center}
\begin{tabular}{ | r | r | r | r | r | }
\hline
& A & B & C & D \\
\hline
1 & 15 & & & \\
\hline
2 & 19 & 17 & & \\
\hline
3 & & 3 & 25 & \\
\hline
4 & 6 & & & 14 \\
\hline
\end{tabular}
\end{center}
\item Taking D3 as the entering cell, use the stepping-stone method twice to obtain an improved solution. You must make your method clear by stating your shadow costs, improvement indices, routes, entering cells and exiting cells.
\item Determine whether your solution from (d) is optimal. Justify your answer.
\end{enumerate}
\hfill \mbox{\textit{Edexcel D2 2016 Q5 [12]}}