Instructions:

Use GLPK tool to answer all the questions.

Clearly explain the procedures followed in achieving the specied results in the report.

Clearly explain if you make any assumptions.

Attach the model les and any additional scripts used with the report as a single compressed le.

3. Minimum Cost Flow Problem Find the minimum-cost flow from node 1 to node 6 for the network shown in Figure 3. Cost, capacity 4, 40 2) 3.10 5, 50 2, 40 2, 20 V-80 Source 1, 30 v=80 1,3011 2,20 Destination 3,100 1,20 52, 50 41,30 Figure 3: Network cost-capacity model. 3. Minimum Cost Flow Problem Find the minimum-cost flow from node 1 to node 6 for the network shown in Figure 3. Cost, capacity 4, 40 2) 3.10 5, 50 2, 40 2, 20 V-80 Source 1, 30 v=80 1,3011 2,20 Destination 3,100 1,20 52, 50 41,30 Figure 3: Network cost-capacity model