formulate an optimization problem ( linear programming)

Include: decision variables, objective function, contraints.

transportation/ assignment problem

We want to minimize the number of drivers, but we need to reach
each location at least once.

A driver can be on duty for 14 hours, but can only drive for 11
of those 14 hours. The driver must start in hartford and end in
Hartford when his shift is over. There is a 20 minute delay at each
location (when a driver gets to a location he must wait there for
20 minutes before leaving back to Hartford).

Time it takes to go from Hartford to other locations:

Hart-South Windor: 26 min

Hart-Springfield: 51 min

Hartford-Worcester: 36 min

Hart-Boston: 86 min

Hart-Natick 58 min

Hart- brockton: 85 min

Hart- Providence 70 min

Hart- Warren 81 min

Hart- Cape Cod 92 min

you can assume it takes the same amount of time to travel back
to Hart.