Transportation problems Decision 2

Papers
A level Paper 4D; AS Paper 2 (option 28)
Level
A level only
Spec
D2.1.1, D2.1.2, D2.1.3
Booklet
Nothing is given.
Since 2018
30 question parts, 77 marks

Notes, worked examples and practice for this topic are being written by our tutors. The past-paper questions below are ready now: work each one on paper, then open the mark scheme and the examiner's comment.

Past-paper questions

Print this topic as a pack questions first, then the mark schemes

Tap a question to zoom it. Mark scheme and examiner's comment open under each question.
June 2025 · Paper 4D (Decision 2) · Q3(a) 1 mark
3. The table below shows the cost, in pounds, of transporting one unit of stock from each of four supply points, A, B, C and D, to three demand points, P, Q and R. It also shows the stock held at each supply point and the number of units required at each demand point. A minimum cost solution is required. P Q R Supply A B C Demand (a) Use the north-west corner method to obtain an initial solution to this transportation problem. (1)
June 2025 · Paper 4D (Decision 2) · Q3(b) 4 marks
(b) Perform one iteration of the stepping-stone method to obtain an improved solution. You must make your method clear by showing the route and stating the • shadow costs • improvement indices • entering cell and exiting cell (4)
June 2025 · Paper 4D (Decision 2) · Q3(c) 5 marks
(c) Formulate the transportation problem as a linear programming problem. You must define your decision variables and make the objective function and constraints clear. (5)
June 2024 · Paper 4D (Decision 2) · Q3(a) 1 mark
3. The table below shows the cost, in pounds, of transporting one unit of stock from each of four supply points, E, F, G and H, to three sales points, A, 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. A B C Supply E F G H Demand (a) Explain why it is necessary to add a dummy demand point. (1)
June 2024 · Paper 4D (Decision 2) · Q3(b) 1 mark
(b) On Table 1 in the answer book, insert appropriate values in the dummy demand column, D. (1)
June 2024 · Paper 4D (Decision 2) · Q3(c) 6 marks
After finding an initial feasible solution and applying one iteration of the stepping‑stone method, the table becomes A B C E F G H (c) 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 • shadow costs • improvement indices • entering and exiting cells (6)
June 2024 · Paper 4D (Decision 2) · Q3(d) 1 mark
(d) State the cost of the solution found in (c). (1)
June 2024 · Paper 4D (Decision 2) · Q3(e) 3 marks
(e) Determine whether the solution obtained in (c) is optimal, giving a reason for your answer. (3)
June 2023 · Paper 4D (Decision 2) · Q3(a) 2 marks
3. The table below shows the stock held at each supply point and the stock required at each demand point in a standard transportation problem. The table also shows the cost, in pounds, of transporting the stock from each supply point to each demand point. Q R S Supply A B C Demand The problem is partially described by the linear programming formulation below. Let xij be the number of units transported from i to j where i=< <= ¥ A B C D , , , j=< <= ¥ and xij=<0 Q R S , , Minimise P x x x x x x AQ AR AS BQ BR BS x x x x x x CQ CR CS DQ DR DS (a) Write down, as inequalities, the constraints of the linear program. (2)
June 2023 · Paper 4D (Decision 2) · Q3(b) 1 mark
(b) Use the north-west corner method to obtain an initial solution to this transportation problem. (1)
June 2023 · Paper 4D (Decision 2) · Q3(c) 2 marks
(c) Taking AS as the entering cell, use the stepping-stone method to find an improved solution. Make your route clear. (2)
June 2023 · Paper 4D (Decision 2) · Q3(d) 4 marks
(d) Perform one further iteration of the stepping-stone method to obtain an improved solution. You must make your method clear by showing the route and the • shadow costs • improvement indices • entering cell and exiting cell (4)
June 2022 · Paper 4D (Decision 2) · Q5(a) 1 mark
5. A standard transportation problem is described in the linear programming formulation below. Let xij be the number of units transported from i to j where =$i ∈ {A, B, C, D} j ∈ {R, S, T} and xij 0 Minimise P=$Z=OPxAR + 17xAS + 24xAT + 15xBR + 29xBS + 32xBT + 25xCR + 25xCS + 27xCT + 19xDR + 20xDS + 25xDT subject to ∑xAj 34 ∑xBj 27 ∑xCj 41 ∑xDj 18 ∑xiR 44 ∑xiS 37 ∑xiT k Given that the problem is balanced, (a) state the value of k. (1)
June 2022 · Paper 4D (Decision 2) · Q5(b) 2 marks
(b) Explain precisely what the constraint ∑xiR 44 means in the transportation problem. (2)
June 2022 · Paper 4D (Decision 2) · Q5(c) 2 marks
(c) Use the north‑west corner method to obtain the cost of an initial solution to this transportation problem. (2)
June 2022 · Paper 4D (Decision 2) · Q5(d) 4 marks
(d) Perform one iteration of the stepping‑stone method to obtain an improved solution. You must make your method clear by showing the route and the • shadow costs • improvement indices • entering cell and exiting cell. (4)
Nov 2021 · Paper 4D (Decision 2) · Q3(a) 1 mark
3. The table below shows the cost, in pounds, of transporting one unit of stock from each of four supply points, A, B, C and D, to four sales points, P, Q, R and S. It also shows the number of units held at each supply point and the number of units required at each sales point. A minimum cost solution is required. P Q R S Supply A B C Demand (a) Use the north‑west corner method to obtain an initial solution. (1)
Nov 2021 · Paper 4D (Decision 2) · Q3(b) 2 marks
(b) Taking AS as the entering cell, use the stepping‑stone method to find an improved solution. Make your method clear. (2)
Nov 2021 · Paper 4D (Decision 2) · Q3(c) 4 marks
(c) Perform one further iteration of the stepping‑stone method to obtain an improved solution. You must make your method clear by showing the route and stating the • shadow costs • improvement indices • entering cell and exiting cell (4)
Nov 2021 · Paper 4D (Decision 2) · Q3(d) 1 mark
(d) State the cost of the solution found in (c). (1)
Nov 2021 · Paper 4D (Decision 2) · Q3(e) 3 marks
(e) Determine whether the solution obtained in (c) is optimal, giving a reason for your answer. (3)
Oct 2020 · Paper 4D (Decision 2) · Q3(a) 2 marks
3. Table 1 shows the cost, in pounds, of transporting one unit of stock from each of four supply points, A, B, C and D, to three sales points, P, Q and R. It also shows the number of units held at each supply point and the number of units required at each sales point. A minimum cost solution is required. P Q R Supply A B C Demand Table 1 Table 2 shows an initial solution given by the north-west corner method. P Q R A B C Table 2 (a) Taking AR as the entering cell, use the stepping-stone method to find an improved solution. Make your method clear. (2)
Oct 2020 · Paper 4D (Decision 2) · Q3(b) 4 marks
(b) Perform one further iteration of the stepping-stone method to obtain an improved solution. You must make your method clear by stating ● shadow costs ● improvement indices ● route ● entering cell and exiting cell. (4)
Oct 2020 · Paper 4D (Decision 2) · Q3(c) 3 marks
(c) Determine whether the solution obtained from this second iteration is optimal, giving the reason for your answer. (3)
Oct 2020 · Paper 4D (Decision 2) · Q3(d) 6 marks
(d) Formulate this situation as a linear programming problem. You must define your decision variables and make the objective function and constraints clear. (6)
Oct 2020 · Paper 4D (Decision 2) · Q3(e) 1 mark
(e) Explain why the Simplex algorithm cannot be used to solve transportation linear programming problems such as that formulated in (d). (1)
June 2019 · Paper 4D (Decision 2) · Q1(a) 2 marks
1. Table 1 shows the cost, in pounds, of transporting one unit of stock from each of four supply points, A, B, C and D, to each of four demand points, P, Q, R and S. It also shows the stock held at each supply point and the stock required at each demand point. A minimum cost solution is required. P Q R S Supply A B C Demand Table 1 Table 2 shows an initial solution given by the north-west corner method. P Q R S A B C Table 2 (a) Taking DQ as the entering cell, use the stepping-stone method to find an improved solution. Make your method clear. (2)
June 2019 · Paper 4D (Decision 2) · Q1(b) 4 marks
(b) Perform one further iteration of the stepping-stone method to obtain an improved solution. You must make your method clear by stating the Ɣ shadow costs Ɣ improvement indices Ɣ route Ɣ entering cell and exiting cell. (4)
June 2019 · Paper 4D (Decision 2) · Q1(c) 3 marks
(c) Determine whether the solution obtained from this second iteration is optimal, giving a reason for your answer. (3)
June 2019 · Paper 4D (Decision 2) · Q1(d) 1 mark
(d) State the cost of the solution found in (b). (1)

Find an Edexcel Further Maths tutor

Stuck on this? Book a trial lesson with our Further Maths tutor.

Prefer email? Send an enquiry

If you are under 18, please include a parent's contact details. Enquiries go to enquiries@alevelfurthermathstutor.com and are deleted once handled.