- (a) State Bellman's principle of optimality.
(b) Explain what is meant by a minimax route.
(c) Describe a practical problem that would require a minimax route as its solution.
(Total 4 marks) - 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 \(\pounds 100\) s) | 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.
(Total 7 marks)