- Four workers, A, B, C and D, are to be assigned to three tasks, 1, 2 and 3 . Each task must be assigned to just one worker and each worker can do one task only.
Worker A cannot do task 2 and worker D cannot do task 3
The cost of assigning each worker to each task is shown in the table below.
The total cost is to be minimised.
| 1 | 2 | 3 |
| A | 53 | - | 62 |
| B | 48 | 57 | 59 |
| C | 55 | 63 | 58 |
| D | 69 | 49 | - |
Formulate the above situation as a linear programming problem. You must define your decision variables and make the objective function and constraints clear.
(6)
\section*{(Total for Question 1 is 6 marks)}