A small trucking company has n truck drivers (numbered 1,2,...,n) and n planned delivery routes for a particular day (numbered 1,2,...,n).

1.Suppose that each truck driver i [n] is certified to drive the trucking routes Ri [n], where Ri may differ between pilot crews. The airline wants to determine if it is possible to feasibly assign pilot crews to routes so that every route is flown by a certified crew. Using the integer programming formulation, model the airline's problem as an integer program. If needed you may define additional parameters.

2. Suppose instead that every truck driver is qualified to drive every truck route. Each truck driver, i, has h_ij hours of experience driving the truck used on route j. The trucking company wants to assign drivers to routes in order to maximize the total hours of experience that trucker has has on their assigned truck. Using the integer programming formulation, model this problem as an integer program.