Question 2
An airline company has possibly six supervisors that it wants to assign to five scheduled flights for quality checks. This assignment should be done in a way that will minimise the number of days supervisors will be away from their office on this duty. Since supervisors are located in different countries the numbers of days to be spent on duty for specific flights may differ. The table below shows how long each supervisor is estimated to spend out of the office for each of the scheduled flights.
a. Provide a mathematical model for this assignment problem. [5 marks]
b. What is the optimal assignment plan for the model in (a)? (You may use Excel Solver or any appropriate software. Do not submit the excel/results file)
[5 marks]
Question 3
Consider the network diagram below:
a. Assume values on the arcs are distances, determine the shortest path and distance from node A to node G using Dynamic Programming.
[10 marks]
b. Assume all arcs are undirected; find the minimal spanning tree in the network provided.
[5 marks]
c. Assume values on arcs are flow capacities; determine the maximal flow from Node A to Node G using the Ford-Fulkerson Method.
[10 marks]
d. Determine the minimum cut of the network diagram.