June 2019: A level Paper 4D: Decision Mathematics 2

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

Question by question

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

The questions

1(a)1(b)1(c)1(d)2(a)2(b)3(a)3(b)4(a)4(b)4(c)4(d)4(e)5(a)5(b)5(c)6(a)6(b)6(c)6(d)7(a)7(b)7(c)
June 2019 · Paper 4D (Decision 2) · Q1(a) 2 marks transportation problems
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 transportation problems
(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 transportation problems
(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 transportation problems
(d) State the cost of the solution found in (b). (1)
June 2019 · Paper 4D (Decision 2) · Q2(a) 6 marks allocation problems
2. Four workers, Ted (T), Harold (H), James (J) and Margaret (M), are to be assigned to four tasks, 1, 2, 3 and 4. Each worker must be assigned to just one task and each task must be done by just one worker. The profit, in pounds, resulting from allocating each worker to each task, is shown in the table below. The profit is to be maximised. T H J M (a) Reducing rows first, use the Hungarian algorithm to obtain an allocation that maximises the total profit. You must make your method clear and show the table after each stage. (6)
June 2019 · Paper 4D (Decision 2) · Q2(b) 1 mark allocation problems
(b) Determine the resulting total profit. (1)
June 2019 · Paper 4D (Decision 2) · Q3(a) 1 mark dynamic programming
3. A –24 G E H B T S x –24 –17 –25 F I C –30 J Figure 1 In Figure 1 the weight of arc SB is denoted by x where x . 0 (a) Explain why Dijkstra’s algorithm cannot be used on the directed network in Figure 1. (1)
June 2019 · Paper 4D (Decision 2) · Q3(b) 12 marks dynamic programming
It is given that the minimum weight route from S to T passes through B. (b) Use dynamic programming to find (i) the range of possible values of x (ii) the minimum weight route from S to T. (12)
June 2019 · Paper 4D (Decision 2) · Q4(a) 2 marks game theory
4. Player B Option X Option Y Option Z Option P –2 Player A Option Q –4 –2 Option R –1 A two person zero-sum game is represented by the pay-off matrix for player A shown above. (a) Verify that there is no stable solution to this game. (2)
June 2019 · Paper 4D (Decision 2) · Q4(b) 3 marks game theory
Player A intends to make a random choice between options P, Q and R, choosing option P with probability p1, option Q with probability p2 and option R with probability p3 Player A wants to find the optimal values of p1 , p2 and p3 using the Simplex algorithm. Player A formulates the following linear programming problem for the game, writing the constraints as inequalities. Maximise P = V subject to V . 3p1 – 4p2 + p3 V . –2p1 + 4p2 + 2p3 V . –2p2 – p3 p1 + p2 + p3 - 1 p1 . 0, p2 . 0, p3 . 0, V . 0 (b) Correct the errors made by player A in the linear programming formulation of the game, giving reasons for your answer. (3)
June 2019 · Paper 4D (Decision 2) · Q4(c) 3 marks game theory
(c) Write down an initial Simplex tableau for the corrected linear programming problem. (3)
June 2019 · Paper 4D (Decision 2) · Q4(d) 2 marks game theory
The Simplex algorithm is used to solve the corrected linear programming problem. The optimal values are p1 = 0.6, p2 = 0 and p3= 0.4 (d) Calculate the value of the game to player A. (2)
June 2019 · Paper 4D (Decision 2) · Q4(e) 4 marks game theory
(e) Determine the optimal strategy for player B, making your reasoning clear. (4)
June 2019 · Paper 4D (Decision 2) · Q5(a) 2 marks recurrence relations d2
5. An increasing sequence {un} for n  ` is such that the difference between the nth term of {un} and the mean of the previous two terms of {un} is always 6 (a) Show that, for n . 3 2un – un – 1 – un – 2 = 12 (2)
June 2019 · Paper 4D (Decision 2) · Q5(b) 7 marks recurrence relations d2
Given that u1 = 2 and u2 = 8 (b) find the solution of this second order recurrence relation to obtain an expression for un in terms of n. (7)
June 2019 · Paper 4D (Decision 2) · Q5(c) 2 marks recurrence relations d2
(c) Show that as n o ’, un o kn where k is a constant to be determined. You must give reasons for your answer. (2)
June 2019 · Paper 4D (Decision 2) · Q6(a) 2 marks flows in networks
6. C2 (10, 12) (5, 8) H A E C1 (7, 9) (3, 5) (3, 5) (2, 4) (10, 14) (17, 20) C G S (8, 11) (5, 7) (4, 7) (5, 6) (3, 6) (13, 17) (0, 4) (6, 8) T F B (3, 5) (1, 2) (4, 7) (4, 4) C2 C1 Figure 2 Figure 2 shows a capacitated, directed network. The network represents a system of pipes through which fluid flows from a source, S, to a sink, T. The numbers (l, u) on each arc represent, in litres per second, the lower capacity, l, and the upper capacity, u, of the corresponding pipe. Two cuts C1 and C2 are shown. (a) Find the capacity of (i) cut C1 (ii) cut C2 (2)
June 2019 · Paper 4D (Decision 2) · Q6(b) 1 mark flows in networks
(b) Explain why the arcs AE and CE cannot be at their upper capacities simultaneously. (1)
June 2019 · Paper 4D (Decision 2) · Q6(c) 1 mark flows in networks
(c) Explain why a flow of 31 litres per second through the system is not possible. (1)
June 2019 · Paper 4D (Decision 2) · Q6(d) 4 marks flows in networks
(d) Hence determine a minimum feasible flow and a maximum feasible flow through the system. You must draw these feasible flows on the diagrams in the answer book and give reasons to justify your answer. You should not apply the labelling procedure to find these flows. (4)
June 2019 · Paper 4D (Decision 2) · Q7(a) 6 marks decision analysis
7. Aisha is deciding whether or not to play a game. The game involves rolling three fair six-sided dice, which have faces numbered from 1 to 6 If the total score on the three dice is 16 or more then she wins a prize. If the total score is 15 or less then she loses and will have to pay the person running the game £3 (a) Given that the prize is £15 (i) draw a decision tree to model Aisha’s possible decisions and the possible outcomes (ii) determine Aisha’s optimal EMV and state the optimal strategy indicated by the decision tree. (6)
June 2019 · Paper 4D (Decision 2) · Q7(b) 2 marks decision analysis
-m 500 where m is the amount The utility function of the game to Aisha is u(m) = 1 – e of money that Aisha has available. Given that Aisha has exactly £3 and that the prize is now £x (b) find the expected utility to Aisha of playing the game in the form ( x c ) + ⎛ ⎞ a - e ⎜ - ⎟ b ⎜ ⎟ ⎝ ⎠ where a, b and c are integers to be found. (2)
June 2019 · Paper 4D (Decision 2) · Q7(c) 4 marks decision analysis
Aisha decides to use the expected utilities to determine whether she should play the game or not. (c) Find the minimum prize for which Aisha would consider playing the 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.