Search for the shortest path (the path with minimum distance) from Buffalo (A) to Duluth (G) according to the given network. (All link distances are in kilometers in the figure.) Use the minimum cost network flow problem (MCNFP) approach.

First, develop a mathematical model which aims to minimize the total distance of the problem.

Then, solve the model by using the MCNFP.xlsx file which includes all data of the problem.

Write the required Excel formulas to the related cells.

Use Excel Solver to solve your optimization problem. In the solution, optimal values of all decision variables, objective function, and left-hand side of constraints must be visible.

Interpret your solution, and state the optimal route.