OCR D2 (Decision Mathematics 2)

1. The payoff matrix for player \(A\) in a two-person zero-sum game is shown below.

Find the optimal strategy for each player and the value of the game. \section*{2. \$ FMMUMLTIP HIR3 UFHGHQFH} \includegraphics[max width=\textwidth, alt={}, center]{06378fdc-2d77-4bdc-810a-1ce9de180c3d-2_49_232_264_310}
ஏ\% 11)
\includegraphics[max width=\textwidth, alt={}, center]{06378fdc-2d77-4bdc-810a-1ce9de180c3d-2_49_428_374_310}
ه' ாணம்
\includegraphics[max width=\textwidth, alt={}, center]{06378fdc-2d77-4bdc-810a-1ce9de180c3d-2_56_451_484_310}
\includegraphics[max width=\textwidth, alt={}, center]{06378fdc-2d77-4bdc-810a-1ce9de180c3d-2_56_442_541_310}
\includegraphics[max width=\textwidth, alt={}, center]{06378fdc-2d77-4bdc-810a-1ce9de180c3d-2_49_435_598_310}
\includegraphics[max width=\textwidth, alt={}, center]{06378fdc-2d77-4bdc-810a-1ce9de180c3d-2_51_426_651_310}
\includegraphics[max width=\textwidth, alt={}, center]{06378fdc-2d77-4bdc-810a-1ce9de180c3d-2_56_485_705_310}
\includegraphics[max width=\textwidth, alt={}, center]{06378fdc-2d77-4bdc-810a-1ce9de180c3d-2_54_485_762_310}
\includegraphics[max width=\textwidth, alt={}, center]{06378fdc-2d77-4bdc-810a-1ce9de180c3d-2_58_479_817_310}
\includegraphics[max width=\textwidth, alt={}, center]{06378fdc-2d77-4bdc-810a-1ce9de180c3d-2_54_460_872_310}
\includegraphics[max width=\textwidth, alt={}, center]{06378fdc-2d77-4bdc-810a-1ce9de180c3d-2_56_501_927_310} \section*{Fig. 1} Construct an activity network
Use appropriate forward and backward scanning to find

1. the minimum number of days needed to complete the entire project,
2. the activities which lie on the critical path.

1. Arthur is planning a bus journey from town \(A\) to town \(L\). There are various routes he can take but he will have to change buses three times - at \(B , C\) or \(D\), at \(E , F , G\) or \(H\) and at \(I , J\) or \(K\).

\begin{figure}[h] \end{figure} Figure 2 shows the bus routes that Arthur can use. The number on each arc shows the average waiting time, in minutes, for a bus to come on that route. As the forecast is for rain, Arthur wishes to plan his journey so that the total waiting time is as small as possible. Use dynamic programming to find the route that Arthur should use.

4. A construction company has three teams of workers available, each of which is to be assigned to one of four jobs at a site. The following table shows the estimated cost, in tens of pounds, of each team doing each job: Use the Hungarian algorithm to find an allocation of jobs which will minimise the total cost. Show the state of the table after each stage in the algorithm and state the cost of the final assignment.

5. The following matrix gives the capacities of the pipes in a system.

1. Represent this information as a digraph.
2. Find the minimum cut, expressing it in the form \(\{ \} \mid \{ \}\), and state its value.
3. Starting from having no flow in the system, use the labelling procedure to find a maximal flow through the system. You should list each flow-augmenting route you use, together with its flow.
4. Explain how you know that this flow is maximal.

6. The payoff matrix for player \(A\) in a two-person zero-sum game is shown below.

1. Formulate this information as a linear programming problem, the solution to which will give the optimal strategy for player \(B\).
   (7 marks)
2. By solving this linear programming problem, find the optimal strategy for player \(B\) and the value of the game.