Oct 2020: 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(a) Allocation (assignment) problems and the Hungarian algorithm 7 —
1(b) Allocation (assignment) problems and the Hungarian algorithm 1 —
2(a) Decision analysis: decision trees and expected values 3 —
2(b) Decision analysis: decision trees and expected values 4 —
3(a) Transportation problems 2 —
3(b) Transportation problems 4 —
3(c) Transportation problems 3 —
3(d) Transportation problems 6 —
3(e) Transportation problems 1 —
4(a) Recurrence relations (Decision 2) 2 —
4(b) Recurrence relations (Decision 2) 6 —
5(a) Flows in networks 1 —
5(b) Flows in networks 1 —
5(c) Flows in networks 1 —
5(d) Flows in networks 2 —
5(e) Flows in networks 2 —
5(f) Flows in networks 3 —
6(a) Game theory 2 —
6(b) Game theory 3 —
6(c) Game theory 1 —
6(d) Game theory 1 —
6(e) Game theory 3 —
6(f) Game theory 4 —
7(a) Dynamic programming 10 —
7(b) Dynamic programming 2 —

The questions

1(a)1(b)2(a)2(b)3(a)3(b)3(c)3(d)3(e)4(a)4(b)5(a)5(b)5(c)5(d)5(e)5(f)6(a)6(b)6(c)6(d)6(e)6(f)7(a)7(b)
Oct 2020 · Paper 4D (Decision 2) · Q1(a) 7 marks allocation problems
1. Four workers, A, B, C and D, are to be assigned to four tasks, 1, 2, 3 and 4. Each worker must be assigned to exactly one task and each task must be done by exactly one worker. Worker A cannot do task 3 and worker B cannot do task 4 The table below shows the profit, in pounds, that each worker would earn if assigned to each of the tasks. A – B – C (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. (7)
Oct 2020 · Paper 4D (Decision 2) · Q1(b) 1 mark allocation problems
(b) Determine the resulting total profit. (1)
Oct 2020 · Paper 4D (Decision 2) · Q2(a) 3 marks decision analysis
2. Jenny can choose one of three options, A, B or C, when playing a game. The profit, in pounds, associated with each outcome and their corresponding probabilities are shown on the decision tree in Figure 1. 0.6 -140 0.4 A 0.75 B -190 0.25 C 0.8 -230 0.2 Figure 1 (a) Calculate the optimal EMV to determine Jenny’s best course of action. You must make your working clear. (3)
Oct 2020 · Paper 4D (Decision 2) · Q2(b) 4 marks decision analysis
x -e For a profit of £ x, Jenny’s utility is given by 1 - (b) Using expected utility as the criterion for the best course of action, determine what Jenny should do now to maximise her profit. You must make your working clear. (4)
Oct 2020 · Paper 4D (Decision 2) · Q3(a) 2 marks transportation problems
3. 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 three sales points, P, Q and R. 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 Supply A B C Demand Table 1 Table 2 shows an initial solution given by the north-west corner method. P Q R A B C Table 2 (a) Taking AR as the entering cell, use the stepping-stone method to find an improved solution. Make your method clear. (2)
Oct 2020 · Paper 4D (Decision 2) · Q3(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 ● shadow costs ● improvement indices ● route ● entering cell and exiting cell. (4)
Oct 2020 · Paper 4D (Decision 2) · Q3(c) 3 marks transportation problems
(c) Determine whether the solution obtained from this second iteration is optimal, giving the reason for your answer. (3)
Oct 2020 · Paper 4D (Decision 2) · Q3(d) 6 marks transportation problems
(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 transportation problems
(e) Explain why the Simplex algorithm cannot be used to solve transportation linear programming problems such as that formulated in (d). (1)
Oct 2020 · Paper 4D (Decision 2) · Q4(a) 2 marks recurrence relations d2
4. The complementary function for the second order recurrence relation un + 2 + alpha un + 1 + beta un = 20 (-3) n n 0 is given by un = A (2) n + B (-1) n where A and B are arbitrary non-zero constants. (a) Find the value of alpha and the value of beta . (2)
Oct 2020 · Paper 4D (Decision 2) · Q4(b) 6 marks recurrence relations d2
Given that 2u0 = u1 and u4 = 164 (b) find the solution of this second order recurrence relation to obtain an expression for un in terms of n. (6)
Oct 2020 · Paper 4D (Decision 2) · Q5(a) 1 mark flows in networks
5. (5, 8) (5, 7) A G C1 (4, 8) (1, 2) (4, 6) (6, 10) (0, 2) C (1, 6) (5, 7) (2, 3) H E (3, 6) (1, 1) (3, 7) (4, 6) (4, 5) B (0, 4) J F (2, 5) C1 Figure 2 Figure 2 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 capacities and upper capacities for the corresponding pipes, in litres per second. (a) State the source node. (1)
Oct 2020 · Paper 4D (Decision 2) · Q5(b) 1 mark flows in networks
(b) Explain why the sink node must be G. (1)
Oct 2020 · Paper 4D (Decision 2) · Q5(c) 1 mark flows in networks
(c) Calculate the capacity of the cut C1 (1)
Oct 2020 · Paper 4D (Decision 2) · Q5(d) 2 marks flows in networks
(d) Assuming that a feasible flow exists, (i) explain why arc JH must be at its upper capacity, (ii) explain why arcs AD and CD must be at their lower capacities. (2)
Oct 2020 · Paper 4D (Decision 2) · Q5(e) 2 marks flows in networks
(e) Use Diagram 1 in the answer book to show a flow of 18 litres per second through the system. (2)
Oct 2020 · Paper 4D (Decision 2) · Q5(f) 3 marks flows in networks
(f) Prove that the answer to (e) is the maximum flow through the system. (3)
Oct 2020 · Paper 4D (Decision 2) · Q6(a) 2 marks game theory
6. Player B Option X Option Y Option Z Option Q Option R -3 Player A Option S -4 -2 Option T -2 A two person zero-sum game is represented by the pay-off matrix for player A, shown above. (a) Explain, with justification, why this matrix may be reduced to a 3 x 3 matrix by removing option S from player A’s choices. (2)
Oct 2020 · Paper 4D (Decision 2) · Q6(b) 3 marks game theory
(b) Verify that there is no stable solution to the reduced game. (3)
Oct 2020 · Paper 4D (Decision 2) · Q6(c) 1 mark game theory
Player A intends to make a random choice between options Q, R and T, choosing option Q with probability p1, option R with probability p2 and option T 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 programme, writing the constraints as inequalities. Maximise P = V, where V = the value of original game + 3 subject to V 4p1 + 7p2 + 6p3 V 8p1 + p3 V 6p1 + 4p2 + 3p3 p1 + p2 + p3 1 p1 0, p2 0, p3 0, V 0 (c) Explain why V cannot exceed any of the following expressions 4p1 + 7p2 + 6p3 8p1 + p3 6p1 + 4p2 + 3p3 (1)
Oct 2020 · Paper 4D (Decision 2) · Q6(d) 1 mark game theory
(d) Explain why it is necessary to use the constraint p1 + p2 + p3 1 (1)
Oct 2020 · Paper 4D (Decision 2) · Q6(e) 3 marks game theory
The Simplex algorithm is used to solve the linear programming problem. Given that the optimal value of p1 = 7 11 and the optimal value of p3 = 0 (e) calculate the value of the game to player A. (3)
Oct 2020 · Paper 4D (Decision 2) · Q6(f) 4 marks game theory
Player B 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 (f) Determine the optimal strategy for player B, making your working clear. (4)
Oct 2020 · Paper 4D (Decision 2) · Q7(a) 10 marks dynamic programming
7. A manufacturer can export five batches of footwear each year. Each exported batch contains just one type of footwear. The types of footwear are trainers, sandals or high heels. The table below shows the profit, in £1000s, for the number of batches of each type of footwear. Number of batches Trainers Sandals High heels x The total annual profit is to be maximised. (a) Use dynamic programming to determine the two possible values of the maximum total annual profit, giving one of these values in terms of x. (10)
Oct 2020 · Paper 4D (Decision 2) · Q7(b) 2 marks dynamic programming
Given that the maximum total annual profit is £320 000 (b) advise the manufacturer on the possible ways in which the five batches should be allocated. (2)

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.