Question: First, we solve the problem by implementing it in Excel using the 2-dimensional matrix representation in worksheet 'Max flow'. J17 X Vfx A B D






First, we solve the problem by implementing it in Excel using the 2-dimensional matrix representation in worksheet 'Max flow'. J17 X Vfx A B D - E F G H Yakline 2 3 4 Flows 5 Wash, DC Chicago Dallas Kansas City Denver San Fran. 6 7 8 outflow 0 0 0 0 9 Wash, DC Chicago Dallas Kansas City Denver San Fran. inflow outflow net inflow 0 0 = = = = = Net demand 0 0 0 0 0 0 0 10 11 12 13 14 15 16 17 18 Max flow 19 20 21 22 Capacities 23 24 25 26 27 28 29 30 31 Wash, DC Denver San Fran. Chicago 800 Dallas 700 725 Kansas City 650 700 725 Wash, DC Chicago Dallas Kansas City Denver San Fran. 625 750 900 1000000 Max flow Max flow (2) + 22. Complete the Excel implementation in worksheet Max flow', solve the problem using Solver, and generate the sensitivity report. 23. Write down the Excel formula that goes in cell B18 of worksheet Max flow'. 24. Write down the Solver constraint formula that restricts each arc flow to be at most its capacity. 25. Is the optimal solution unique? Next we solve the problem by implementing it in Excel using the arc-list representation in worksheet Max flow (2). B16 fx B C D E F G H - J L K Yakline 1 2 3 Arcs Ship From To 4 1 2 Node inflow outflow Net Flow 1 5 6 1 1 2 2 3 7 Maximum 800 700 650 725 700 625 750 900 725 10000000 8 9 10 4 Wash, DC Wash, DC Wash, DC Chicago Chicago Kansas City Kansas City Denver Dallas San Fran. City Wash, DC Chicago Dallas Kansas City Denver San Fran. 2 4 4 3 4 3 5 3 5 6 6 1 Chicago Dallas Kansas City Dallas Denver Dallas Denver San Fran. San Fran. Wash. DC 5 6 5 3 6 11 12. 13 14 15 16 Max Flow 17 18 19 20 21 22 23 24 25 Max flow Max flow (2) + 26. Complete the Excel implementation in worksheet Max flow (2)' and solve the problem using Solver. 27. Write down the Excel formula that goes in cell J6 of worksheet Max flow (2). 28. Write down the Excel formula that goes in cell K9 of worksheet Max flow (2)'. 29. The optimal objective value is 1,625,000 calls. What is the lowest capacity (in 1,000s) for the segment between Washington DC and Kansas City that still allows to attain this maximum solution? First, we solve the problem by implementing it in Excel using the 2-dimensional matrix representation in worksheet 'Max flow'. J17 X Vfx A B D - E F G H Yakline 2 3 4 Flows 5 Wash, DC Chicago Dallas Kansas City Denver San Fran. 6 7 8 outflow 0 0 0 0 9 Wash, DC Chicago Dallas Kansas City Denver San Fran. inflow outflow net inflow 0 0 = = = = = Net demand 0 0 0 0 0 0 0 10 11 12 13 14 15 16 17 18 Max flow 19 20 21 22 Capacities 23 24 25 26 27 28 29 30 31 Wash, DC Denver San Fran. Chicago 800 Dallas 700 725 Kansas City 650 700 725 Wash, DC Chicago Dallas Kansas City Denver San Fran. 625 750 900 1000000 Max flow Max flow (2) + 22. Complete the Excel implementation in worksheet Max flow', solve the problem using Solver, and generate the sensitivity report. 23. Write down the Excel formula that goes in cell B18 of worksheet Max flow'. 24. Write down the Solver constraint formula that restricts each arc flow to be at most its capacity. 25. Is the optimal solution unique? Next we solve the problem by implementing it in Excel using the arc-list representation in worksheet Max flow (2). B16 fx B C D E F G H - J L K Yakline 1 2 3 Arcs Ship From To 4 1 2 Node inflow outflow Net Flow 1 5 6 1 1 2 2 3 7 Maximum 800 700 650 725 700 625 750 900 725 10000000 8 9 10 4 Wash, DC Wash, DC Wash, DC Chicago Chicago Kansas City Kansas City Denver Dallas San Fran. City Wash, DC Chicago Dallas Kansas City Denver San Fran. 2 4 4 3 4 3 5 3 5 6 6 1 Chicago Dallas Kansas City Dallas Denver Dallas Denver San Fran. San Fran. Wash. DC 5 6 5 3 6 11 12. 13 14 15 16 Max Flow 17 18 19 20 21 22 23 24 25 Max flow Max flow (2) + 26. Complete the Excel implementation in worksheet Max flow (2)' and solve the problem using Solver. 27. Write down the Excel formula that goes in cell J6 of worksheet Max flow (2). 28. Write down the Excel formula that goes in cell K9 of worksheet Max flow (2)'. 29. The optimal objective value is 1,625,000 calls. What is the lowest capacity (in 1,000s) for the segment between Washington DC and Kansas City that still allows to attain this maximum solution