Edexcel D2 (Decision Mathematics 2) 2013 June

Question 1
View details
  1. Four workers, Chris (C), James (J), Katie (K) and Nicky (N), are to be allocated to four tasks, 1, 2, 3 and 4. Each worker is to be allocated to one task and each task must be allocated to 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.
1234
Chris127116111113
James225208205208
Katie130113112114
Nicky228212203210
  1. 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.
  2. State which worker should be allocated to each task and the resulting total profit made.
Question 2
View details
2. The table shows the least distances, in km, between six towns, A, B, C, D, E and F.
ABCDEF
A-12221713710982
B122-110130128204
C217110-204238135
D137130204-98211
E10912823898-113
F82204135211113-
Liz must visit each town at least once. She will start and finish at A and wishes to minimise the total distance she will travel.
  1. Starting with the minimum spanning tree given in your answer book, use the shortcut method to find an upper bound below 810 km for Liz's route. You must state the shortcut(s) you use and the length of your upper bound.
    (2)
  2. Use the nearest neighbour algorithm, starting at A , to find another upper bound for the length of Liz's route.
  3. Starting by deleting F , and all of its arcs, find a lower bound for the length of Liz's route.
  4. Use your results to write down the smallest interval which you are confident contains the optimal length of the route.
Question 3
View details
3. Table 1 below shows the cost, in pounds, of transporting one unit of stock from each of four supply points, \(\mathrm { A } , \mathrm { B } , \mathrm { C }\) and D , to four demand points \(1,2,3\) and 4 . It also shows the stock held at each supply point and the stock required at each demand point. A minimum cost solution is required. \begin{table}[h]
1234Supply
A2236193735
B2935303615
C2432254120
D2330233830
Demand30203020
\captionsetup{labelformat=empty} \caption{Table 1}
\end{table} Table 2 shows an initial solution given by the north-west corner method.
Table 3 shows some of the improvement indices for this solution. \begin{table}[h]
1234
A305
B150
C20
D1020
\captionsetup{labelformat=empty} \caption{Table 2}
\end{table} \begin{table}[h]
1234
Axx
Bxx
C82x1
D92xx
\captionsetup{labelformat=empty} \caption{Table 3}
\end{table}
  1. Explain why a zero has been placed in cell B3 in Table 2.
    (1)
  2. Calculate the shadow costs and the missing improvement indices and enter them into Table 3 in your answer book.
  3. Taking the most negative improvement index to indicate the entering cell, state the steppingstone route that should be used to obtain the next solution. You must state your entering cell and exiting cell.
Question 4
View details
4. Robin (R) and Steve (S) play a two-person zero-sum game which is represented by the following pay-off matrix for Robin.
S plays 1S plays 2S plays 3
R plays 1213
R plays 21- 12
R plays 3- 13- 3
Find the best strategy for Robin and the value of the game to him.
Question 5
View details
5. A three-variable linear programming problem in \(x , y\) and \(z\) is to be solved. The objective is to maximise the profit, \(P\).
The following tableau is obtained.
Basic variable\(x\)\(y\)\(z\)\(r\)\(s\)\(t\)Value
\(r\)\(\frac { 1 } { 2 }\)\(- \frac { 1 } { 2 }\)010\(- \frac { 1 } { 2 }\)10
\(s\)\(1 \frac { 1 } { 2 }\)\(2 \frac { 1 } { 2 }\)001\(- \frac { 1 } { 2 }\)5
\(z\)\(\frac { 1 } { 2 }\)\(\frac { 1 } { 2 }\)100\(\frac { 1 } { 2 }\)5
\(P\)-5-1000020220
  1. Starting by increasing \(y\), perform one complete iteration of the Simplex algorithm, to obtain a new tableau, T. State the row operations you use.
  2. Write down the profit equation given by T .
  3. Use the profit equation from part (b) to explain why T is optimal.
Question 6
View details
6. \begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{0af7fd3e-68af-41fc-883b-3bc2589035bb-7_816_1138_178_459} \captionsetup{labelformat=empty} \caption{Figure 1}
\end{figure} Figure 1 shows a capacitated directed network. The number on each arc represents the capacity of that arc. The numbers in circles represent an initial flow.
  1. State the value of the initial flow.
  2. On Diagram 1 and Diagram 2 in the answer book, add a supersource S and a supersink T . On Diagram 1, show the minimum capacities of the arcs you have added.
  3. Complete the initialisation of the labelling procedure on Diagram 2 in the answer book by entering values on the arcs to S and T and on \(\operatorname { arcs } \mathrm { CD }\), DE , DG , FG, FI and GI.
  4. Find the maximum flow through the network. You must list each flow-augmenting route you use, together with its flow.
  5. Show your maximum flow on Diagram 3 in the answer book.
  6. Prove that your flow is maximal.
Question 7
View details
7. A two-person zero-sum game is represented by the following pay-off matrix for player A.
B plays 1B plays 2B plays 3
A plays 11- 32
A plays 2- 23- 1
A plays 35- 10
Formulate the game as a linear programming problem for player A. Write the constraints as inequalities. Define your variables clearly.
(Total 7 marks)
Question 8
View details
8. A factory can process up to five units of carrots each month. Each unit can be sold fresh or frozen or canned.
The profits, in \(\pounds 100\) s, for the number of units sold, are shown in the table.
The total monthly profit is to be maximised.
Number of units012345
Fresh04585120150175
Frozen04570100120130
Canned03575125155195
Use dynamic programming to determine how many of the five units should be sold fresh, frozen and canned in order to maximise the monthly profit. State the maximum monthly profit.
(Total 12 marks)