June 2019: AS Paper 28: Decision Mathematics 2

40 marks · 14 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) Recurrence relations (Decision 2) 4 —
2(b) Recurrence relations (Decision 2) 2 —
3(a) Flows in networks 1 —
3(b) Flows in networks 1 —
3(c) Flows in networks 1 —
3(d) Flows in networks 3 —
3(e) Flows in networks 1 —
3(f) Flows in networks 3 —
4(a) Game theory 3 —
4(b) Game theory 7 —
4(c) Game theory 1 —
4(d) Game theory 4 —

The questions

1(a)1(b)2(a)2(b)3(a)3(b)3(c)3(d)3(e)3(f)4(a)4(b)4(c)4(d)
June 2019 · AS Paper 2 (Decision 2) · Q1(a) 2 marks allocation problems
1. Three workers, A, B and C, are each to be assigned to one of four tasks, P, Q, R and S. Each worker must be assigned to at most one task, and each task must be done by at most one worker. The amount, in pounds, that each worker will earn while assigned to each task is shown in the table below. P Q R S A B C The Hungarian algorithm is to be used to find the maximum total amount that can be earned by the three workers. (a) Explain how the table should be modified. (2)
June 2019 · AS Paper 2 (Decision 2) · Q1(b) 7 marks allocation problems
(b) (i) Reducing rows first, use the Hungarian algorithm to obtain an allocation which maximises the total earnings. (ii) Explain how any initial row and column reductions were made and also how you determined if the table was optimal at each stage. (7)
June 2019 · AS Paper 2 (Decision 2) · Q2(a) 4 marks recurrence relations d2
2. (a) Find the general solution of the recurrence relation un + 1 = 3un + 2n n . 1 (4)
June 2019 · AS Paper 2 (Decision 2) · Q2(b) 2 marks recurrence relations d2
(b) Find the particular solution of this recurrence relation for which u1 = u2 (2)
June 2019 · AS Paper 2 (Decision 2) · Q3(a) 1 mark flows in networks
3. C H A F 7 24 T S 2 6 0 4 7 26 G B E J Figure 1 Alexa is monitoring a system of pipes through which fluid can flow from the source, S, to the sink, T. Currently, fluid is flowing through the system from S to T. Alexa initialises the labelling procedure for this system, and the excess capacities and potential backflows are shown on the arrows either side of each arc, as shown in Figure 1. (a) State the value of the initial flow. (1)
June 2019 · AS Paper 2 (Decision 2) · Q3(b) 1 mark flows in networks
(b) Explain why arcs DF and DG can never both be full to capacity. (1)
June 2019 · AS Paper 2 (Decision 2) · Q3(c) 1 mark flows in networks
(c) Obtain the capacity of the cut that passes through the arcs AC, AD, BD, DE, EG and EJ. (1)
June 2019 · AS Paper 2 (Decision 2) · Q3(d) 3 marks flows in networks
(d) 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)
June 2019 · AS Paper 2 (Decision 2) · Q3(e) 1 mark flows in networks
(e) Use your answers to part (d) to find a maximum flow pattern for this system of pipes and draw it on Diagram 1 in the answer book. (1)
June 2019 · AS Paper 2 (Decision 2) · Q3(f) 3 marks flows in networks
(f) Prove that the answer to part (e) is optimal. (3)
June 2019 · AS Paper 2 (Decision 2) · Q4(a) 3 marks game theory
4. The table below gives the pay-off matrix for a zero-sum game between two players, Aljaz and Brendan. The values in the table show the pay-offs for Aljaz. Brendan Option X Option Y Option Z Option P í6 í1 Aljaz Option Q í7 Option R (a) (i) Show that this game is stable. (ii) State the value of this game to Brendan. (3)
June 2019 · AS Paper 2 (Decision 2) · Q4(b) 7 marks game theory
Option R is removed from Aljaz’s choices and the reduced game, with option R removed, is no longer stable. (b) Find the best strategy for Aljaz in this reduced game, defining any variable you use. (7)
June 2019 · AS Paper 2 (Decision 2) · Q4(c) 1 mark game theory
(c) Explain why Brendan should never play option Y (1)
June 2019 · AS Paper 2 (Decision 2) · Q4(d) 4 marks game theory
Let Brendan play option X with probability q (d) (i) Explain why q satisfies the equation 6q í 2(1 í q) = 1.6 (ii) Hence find the best strategy for Brendan in this reduced game. (4)

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.