D2 June 2006 Q2
2. Three workers, \(P\), \(Q\) and \(R\), are to be assigned to three tasks, 1, 2 and 3. Each worker is to be assigned to one task and each task must be assigned to one worker. The cost, in hundreds of pounds, of using each worker for each task is given in the table below. The cost is to be minimised.
| Cost (in £100s) | Task 1 | Task 2 | Task 3 |
|---|---|---|---|
| Worker \(P\) | 8 | 7 | 3 |
| Worker \(Q\) | 9 | 5 | 6 |
| Worker \(R\) | 10 | 4 | 4 |
Formulate the above situation as a linear programming problem, defining the decision variables and making the objective and constraints clear. (7)
| Scheme | Marks |
|---|---|
| Let \(x_{ij} = 1\) if worker does task, 0 otherwise | B1 |
| where \(x_{ij}\) indicates the arc from node \(i\) to node \(j\) i.e \(i \in \{P, Q, R\}\), \(j \in \{1, 2, 3\}\) | B1 |
| \(x_{p1} + x_{p2} + x_{p3} = 1\qquad x_{p1} + x_{q1} + x_{r1} = 1\) | M1 |
| \(x_{q1} + x_{q2} + x_{q3} = 1\) and \(x_{p2} + x_{q2} + x_{r2} = 1\) | A1 |
| \(x_{r1} + x_{r2} + x_{r3} = 1\qquad x_{p3} + x_{q3} + x_{r3} = 1\) | A1 (3) |
| Minimise, \(C = 8x_{p1} + 7x_{p2} + 3x_{p3} + 9x_{q1} + 5x_{q2} + 6x_{q3} + 10x_{r1} + 4x_{r2} + 4x_{r3}\) where \(C\) is in hundreds of pounds | B1, B1 (2) |
| (7 marks) |
Notes
B1 cao
B1 defining variable – attempt
M1 at least 3 equations – coefficients of one
A1 cao 3 correct
A1 cao 6 correct
B1 Minimise
B1 cao (condone a slip) (- accept cost in pounds)
(The printed scheme writes “i.e P, Q, R j E 1, 2, 3”, read here as \(i \in \{P, Q, R\}\), \(j \in \{1, 2, 3\}\).)