D2.1.3 Formulation of the transportation problem as a linear programming…

Section
D2.1 Transportation problems
Level
A level only
Statement
Formulation of the transportation problem as a linear programming problem.
Since 2018
7 parts, 19 marks · topic pages: Transportation problems

Back to the checklist

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 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 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)
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)

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.