A dairy cooperative wants to improve employee morale and implements a survey to its milk truck drivers on the preferred routes that each would like to drive. Suppose there are five drivers and five routes, and that the drivers have indicated the following preferences for each route on a scale of 1-5 with 1 being their first choice and 5 being their last choice:
|
Driver
|
Route 1
|
Route 2
|
Route 3
|
Route 4
|
Route 5
|
|
1
|
1
|
1
|
2
|
3
|
1
|
|
2
|
4
|
5
|
4
|
2
|
2
|
|
3
|
5
|
2
|
5
|
1
|
3
|
|
4
|
3
|
3
|
3
|
5
|
4
|
|
5
|
2
|
4
|
2
|
4
|
5
|
Formulate this as an assignment problem that minimizes the sum of the numeric pref- erences of all drivers.