A planned Cargo Network is illustrated in Figure 1, while Table 1 shows the flight times between two

cities (nodes).

Task 1 (10%)

You need to apply the network and Linear Integer programming model in Microsoft Excel's Solver (or

LpSolve or R) to work out the shortest route and minimum flight time from City 1 (Node 1) to City 10

(Node 10) of the cargo network according to the total flight times given in Table 1.

Task 2 (10%)

You are required to present all analysis processes, including

(1) State clearly the shortest route and minimum flight time you obtained in your network

(2) Examine what function(s) you have used to develop your program

(3) Explain how you used Linear Integer Programming to complete the computation in the

software, as well as how you illustrated the entire calculating process in your Excel / R /

LPSolve program.

Task 3 (5%)

You need to provide a screen recording (no longer than one minute) demonstrating how you compile

your programme (Excel Solver/LpSolve/R) to acquire the results.