June 2025: AS Paper 28: Decision Mathematics 2

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

Question by question

QTopicMarksDifficulty
1(a) Allocation (assignment) problems and the Hungarian algorithm 2 —
1(b) Allocation (assignment) problems and the Hungarian algorithm 7 —
2(a) Flows in networks 2 —
2(b) Flows in networks 1 —
2(c) Flows in networks 2 —
2(d) Flows in networks 1 —
2(e) Flows in networks 2 —
2(f) Flows in networks 3 —
3(a) Game theory 3 —
3(b)(i) Game theory 1 —
3(b)(ii) Game theory 7 —
4(a) Recurrence relations (Decision 2) 6 —
4(b) Recurrence relations (Decision 2) 3 —

The questions

1(a)1(b)2(a)2(b)2(c)2(d)2(e)2(f)3(a)3(b)(i)3(b)(ii)4(a)4(b)
June 2025 · AS Paper 2 (Decision 2) · Q1(a) 2 marks allocation problems
1. Five workers, A, B, C, D and E, are each to be assigned to one of five tasks, J, K, L, M and N. Each task must be assigned to exactly one worker and each worker must do exactly one task. Worker C cannot do task L and worker D cannot do task K. The profit, in pounds, that each worker will make while assigned to each task is shown in the table below. J K L M N A B C – – E The Hungarian algorithm is to be used to find the maximum total profit that can be earned by the five workers. (a) Explain how the contents of the table must be modified to allow the algorithm to be used. (2)
June 2025 · AS Paper 2 (Decision 2) · Q1(b) 7 marks allocation problems
(b) Reducing rows first, use the Hungarian algorithm to obtain the maximum total profit. You should explain how any initial row and column reductions are made and also how you determine if the table is optimal at each stage. (7)
June 2025 · AS Paper 2 (Decision 2) · Q2(a) 2 marks flows in networks
2. C1 C C2 31 31 A G 31 39 72 80 T F S 32 36 14 14 44 48 B H C1 C2 18 30 24 24 E Figure 1 Figure 1 shows a capacitated, directed network of pipes. The number on each arc represents the capacity of the corresponding pipe. The numbers in circles represent a feasible flow from S to T. (a) State the two conditions satisfied by a feasible flow. (2)
June 2025 · AS Paper 2 (Decision 2) · Q2(b) 1 mark flows in networks
(b) List the seven saturated arcs in Figure 1. (1)
June 2025 · AS Paper 2 (Decision 2) · Q2(c) 2 marks flows in networks
(c) Find the capacity of (i) cut C1 (ii) cut C2 (2)
June 2025 · AS Paper 2 (Decision 2) · Q2(d) 1 mark flows in networks
(d) Write down a flow-augmenting route that increases the flow by four units. (1)
June 2025 · AS Paper 2 (Decision 2) · Q2(e) 2 marks flows in networks
(e) Use the answer to part (d) to draw the resulting flow pattern on Diagram 1 in the answer book. (2)
June 2025 · AS Paper 2 (Decision 2) · Q2(f) 3 marks flows in networks
(f) Prove that the answer to part (e) is a maximum flow. (3)
June 2025 · AS Paper 2 (Decision 2) · Q3(a) 3 marks game theory
3. Layla and Mohsin play a zero-sum game represented by the following pay-off matrix for Layla. Mohsin plays X Mohsin plays Y Mohsin plays Z Layla plays P -2 Layla plays Q -4 -5 Layla plays R -1 -3 (a) (i) Find the play-safe strategies for each player. (ii) State, giving a reason, whether there is a stable solution to this game. (3)
June 2025 · AS Paper 2 (Decision 2) · Q3(b)(i) 1 mark game theory
(b) Option R is now removed from Layla’s choices. (i) For each of Mohsin’s three options, find the expected pay-off to Layla when she plays options P and Q equally often. (1)
June 2025 · AS Paper 2 (Decision 2) · Q3(b)(ii) 7 marks game theory
(ii) Use a graphical method to determine Layla’s optimal mixed strategy. You should define any variables you use. (7)
June 2025 · AS Paper 2 (Decision 2) · Q4(a) 6 marks recurrence relations d2
4. A sequence{ un , where n 1, satisfies the recurrence relation } u 1 1 u n n n Given that u1 O 3 (a) solve the recurrence relation, giving un in terms of n (6)
June 2025 · AS Paper 2 (Decision 2) · Q4(b) 3 marks recurrence relations d2
(b) hence determine the number of negative terms in the sequence {un}. You must justify your answer. (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.