Nov 2021: A level Paper 4D: Decision Mathematics 2

75 marks · 25 question parts · Question paper, mark scheme and examiner's report on Pearson's site

Question by question

QTopicMarksDifficulty
1 Allocation (assignment) problems and the Hungarian algorithm 6 —
2 Decision analysis: decision trees and expected values 7 —
3(a) Transportation problems 1 —
3(b) Transportation problems 2 —
3(c) Transportation problems 4 —
3(d) Transportation problems 1 —
3(e) Transportation problems 3 —
4(a) Recurrence relations (Decision 2) 1 —
4(b) Recurrence relations (Decision 2) 8 —
4(c) Recurrence relations (Decision 2) 2 —
5(a) Flows in networks 2 —
5(b) Flows in networks 1 —
5(c) Flows in networks 1 —
5(d) Flows in networks 2 —
5(e) Flows in networks 3 —
5(f) Flows in networks 1 —
5(g) Flows in networks 3 —
5(h) Flows in networks 3 —
6(a) Dynamic programming 1 —
6(b) Dynamic programming 9 —
6(c) Dynamic programming 2 —
7(a) Game theory 2 —
7(b) Game theory 6 —
7(c) Game theory 1 —
7(d) Game theory 3 —

The questions

123(a)3(b)3(c)3(d)3(e)4(a)4(b)4(c)5(a)5(b)5(c)5(d)5(e)5(f)5(g)5(h)6(a)6(b)6(c)7(a)7(b)7(c)7(d)
Nov 2021 · Paper 4D (Decision 2) · Q1 6 marks allocation problems
1. Four workers, A, B, C and D, are to be assigned to three tasks, 1, 2 and 3. Each task must be assigned to just one worker and each worker can do one task only. Worker A cannot do task 2 and worker D cannot do task 3 The cost of assigning each worker to each task is shown in the table below. The total cost is to be minimised. A – B C – Formulate the above situation as a linear programming problem. You must define your decision variables and make the objective function and constraints clear. (6)
Nov 2021 · Paper 4D (Decision 2) · Q2 7 marks decision analysis
2. Alka is considering paying £5 to play a game. The game involves rolling two fair six‑sided dice. If the sum of the numbers on the two dice is at least 8, she receives £10, otherwise she loses and receives nothing. If Alka loses, she can pay a further £5 to roll the dice again. If both dice show the same number then she receives £35, otherwise she loses and receives nothing. (i) Draw a decision tree to model Alka’s possible decisions and the possible outcomes. (ii) Determine Alka’s optimal EMV and state the optimal strategy indicated by the decision tree. (7)
Nov 2021 · Paper 4D (Decision 2) · Q3(a) 1 mark transportation problems
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 transportation problems
(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 transportation problems
(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 transportation problems
(d) State the cost of the solution found in (c). (1)
Nov 2021 · Paper 4D (Decision 2) · Q3(e) 3 marks transportation problems
(e) Determine whether the solution obtained in (c) is optimal, giving a reason for your answer. (3)
Nov 2021 · Paper 4D (Decision 2) · Q4(a) 1 mark recurrence relations d2
4. Sequences {xn} and {yn} for n ∈ , are defined by xn + 1 = 2yn + 3 and yn + 1 = 3xn + 1 – 4xn x1 = 1 and y1 = a where a is a constant. (a) Show that xn + 2 – 6xn + 1 + 8xn = 3 (1)
Nov 2021 · Paper 4D (Decision 2) · Q4(b) 8 marks recurrence relations d2
(b) Solve the second‑order recurrence relation given in (a) to obtain an expression for xn in terms of a and n. (8)
Nov 2021 · Paper 4D (Decision 2) · Q4(c) 2 marks recurrence relations d2
Given that x7 = 28 225 (c) find the value of a. (2)
Nov 2021 · Paper 4D (Decision 2) · Q5(a) 2 marks flows in networks
5. C2 C1 (5, 8) B A (0, 8) G (2, 5) (7, 11) (12, 17) (2, 5) E (4, 10) (4, 8) (3, 8) C S (1, 4) (0, 4) (1, 5) (3, 7) (10, 18) (18, 22) (5, 10) (3, 6) F (20, 30) (0, 2) T C1 C2 Figure 1 Figure 1 shows a capacitated, directed network. The network represents a system of pipes through which fluid can flow. The weights on the arcs show the lower and upper capacities for the corresponding pipes, in litres per second. (a) Calculate the capacity of (i) cut C1 (ii) cut C2 (2)
Nov 2021 · Paper 4D (Decision 2) · Q5(b) 1 mark flows in networks
(b) Using only the capacities of cuts C1 and C2 , state what can be deduced about the maximum flow through the system. (1)
Nov 2021 · Paper 4D (Decision 2) · Q5(c) 1 mark flows in networks
B A G E S C F T Figure 2 Figure 2 shows an initial flow through the same network. (c) State the value of the initial flow. (1)
Nov 2021 · Paper 4D (Decision 2) · Q5(d) 2 marks flows in networks
(d) By entering values along BC, CF and DT, complete the labelling procedure on Diagram 1 in the answer book. (2)
Nov 2021 · Paper 4D (Decision 2) · Q5(e) 3 marks flows in networks
(e) Use the labelling procedure to find a maximum flow through the network. You must list each flow‑augmenting route you use, together with its flow. (3)
Nov 2021 · Paper 4D (Decision 2) · Q5(f) 1 mark flows in networks
(f) Use your answer to (e) to find a maximum flow pattern for this system of pipes and draw it on Diagram 2 in the answer book. (1)
Nov 2021 · Paper 4D (Decision 2) · Q5(g) 3 marks flows in networks
(g) Prove that the answer to (f) is optimal. (3)
Nov 2021 · Paper 4D (Decision 2) · Q5(h) 3 marks flows in networks
A vertex restriction is now applied to B so that no more than 16 litres per second can flow through it. (h) (i) Complete Diagram 3 in the answer book to show this restriction. (ii) State the value of the maximum flow with this restriction. (3)
Nov 2021 · Paper 4D (Decision 2) · Q6(a) 1 mark dynamic programming
6. E H A B S T F I C G J Figure 3 The staged, directed network in Figure 3 represents a series of roads connecting 12 towns, S, A, B, C, D, E, F, G, H, I, J and T. The number on each arc shows the distance between these towns, in miles. Bradley is planning a four‑day cycle ride from S to T. He plans to leave his home at S. On the first night he will stay at A, B or C, on the second night he will stay at D, E, F or G, on the third night he will stay at H, I or J, and he will arrive at his friend’s house at T on the fourth day. Bradley decides that the maximum distance he will cycle on any one day should be as small as possible. (a) Write down the type of dynamic programming problem that Bradley needs to solve. (1)
Nov 2021 · Paper 4D (Decision 2) · Q6(b) 9 marks dynamic programming
(b) Use dynamic programming to complete the table in the answer book. (9)
Nov 2021 · Paper 4D (Decision 2) · Q6(c) 2 marks dynamic programming
(c) Hence write down the possible routes that Bradley could take. (2)
Nov 2021 · Paper 4D (Decision 2) · Q7(a) 2 marks game theory
7. Alexis and Becky are playing a zero‑sum game. Alexis has two options, Q and R. Becky has three options, X, Y and Z. Alexis intends to make a random choice between options Q and R, choosing option Q with probability p1 and option R with probability p2 Alexis wants to find the optimal values of p1 and p2 and formulates the following linear programme, writing the constraints as inequalities. Maximise P = V where V = 3 + the value of the game to Alexis subject=to=$V 6p1 + p2 V 8p2 V 4p1 + 2p2 p1 + p2 1 p1 0 , p2 0 , V 0 (a) Complete the pay‑off matrix for Alexis in the answer book. (2)
Nov 2021 · Paper 4D (Decision 2) · Q7(b) 6 marks game theory
(b) Use a graphical method to find the best strategy for Alexis. (6)
Nov 2021 · Paper 4D (Decision 2) · Q7(c) 1 mark game theory
(c) Calculate the value of the game to Alexis. (1)
Nov 2021 · Paper 4D (Decision 2) · Q7(d) 3 marks game theory
Becky intends to make a random choice between options X, Y and Z, choosing option X with probability q1 , option Y with probability q2 and option Z with probability q3 (d) Determine the best strategy for Becky, making your method and working clear. (3)

Find an Edexcel Further Maths tutor

Want this paper marked and gone through with a Further Maths tutor? Message us.

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.