Edexcel A Level Maths D2 · Decision Mathematics 2 June 2014 question paper 6690

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 just one task and each task must be done by just one worker. Worker A cannot do task 4 and worker B cannot do task 2. The amount, in pounds, that each worker would earn if assigned to the tasks, is shown in the table

Reducing rows first, use the Hungarian algorithm to obtain an allocation that maximises the total earnings. You must make your method clear and show the table after each stage.

The table shows the least times, in seconds, that it takes a robot to travel between six points in an automated warehouse. These six points are an entrance, A, and five storage bins, B, C, D, E and F. The robot will start at A, visit each bin, and return to A. The total time taken for the robot’s route is to be minimised.

Show that there are two nearest neighbour routes that start from A. You must make the routes and their lengths clear.

Starting by deleting F, and all of its arcs, find a lower bound for the time taken for the robot’s route.

Use your results to write down the smallest interval which you are confident contains the optimal time for the robot’s route.

The tableau below is the initial tableau for a three-variable linear programming problem in and z. The objective is to maximise the profit, P.

Taking the most negative number in the profit row to indicate the pivot column at each stage, solve this linear programming problem. Make your method clear by stating the row operations you use.

State the final values of the objective function and each variable.

A two-person zero-sum game is represented by the following pay-off matrix for player A.

Verify that there is no stable solution to this game.

Find the best strategy for player A.

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.

State the value of the initial flow.

Complete the initialisation of the labelling procedure on Diagram 1 in the answer book by entering values along SC, AB, CE, DE and DT.

Hence 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.

Draw a maximal flow pattern on Diagram 2 in the answer book.

Prove that your flow is maximal.

Three warehouses, P, Q and R, supply washing machines to four retailers, A, B, C and D. The table gives the cost, in pounds, of transporting a washing machine from each warehouse to each retailer. It also shows the number of washing machines held at each warehouse and the number of washing machines required by each retailer. The total cost of transportation is to be minimised.

Formulate this transportation problem as a linear programming problem. You must define your decision variables and make the objective function and constraints clear. You do not need to solve this problem.

A company assembles microlight aircraft. They can assemble up to four aircraft in any one month, but if they assemble more than three they will have to hire additional space at a cost of £1000 per month. They can store up to two aircraft at a cost of £500 each per month. The overhead costs are £2000 in any month in which work is done. Aircraft are delivered at the end of each month. There are no aircraft in stock at the beginning of March and there should be none in stock at the end of July. The order book for aircraft is

Use dynamic programming to determine the production schedule which minimises the costs. Show your working in the table provided in the answer book and state the minimum production cost.

_{Pearson Education Ltd copyright policy.}

_________________________________

_________________________________

_________________________________

_________________________________ 1 2 3 4

_________________________________

_________________________________

_________________________________

1 2 3 4 _________________________________

C _________________________________

D _________________________________

1 2 3 4 _________________________________

D _________________________________

_________________________________

_________________________________

_________________________________

_________________________________ 1 2 3 4

_________________________________

_________________________________

_________________________________

_________________________________ 1 2 3 4

_________________________________

_________________________________

_________________________________

_________________________________ 1 2 3 4

C _________________________________

D _________________________________

_________________________________

1 2 3 4 _________________________________

C _________________________________

D _________________________________

_________________________________

2.

3.

You may not need to use all of these tableaux

4.

5. (a) Initial flow value: ______________________________

6.

7.

You may not need to use all of these rows

Production schedule

Minimum production cost £