Question 2 (20 points) Consider the following flow network 10 points) Find the flow pattern giving the maximum flow from the source (1) to the sink (7) by the Ford Folkerson Method [You must use at least one backward arc in your calculations, show all your work and iterations) (10 points) formulate problem as a MONIP. (Write in matrix form) Question 325 points) Following tableaves the mileage of the feasible links connecting the water well with the city center To send the water, there estive pumping stations and the following table how the miles between the well pumps and oty The engineers want to determine the minimum etwork that is the well to the city center (The dashed lines mean there is no pipeline between these pumping station Miles between Adjacent Pumping Stations CamScanner ile tara a) (10 points) Find the flow pattern giving the maximum flow from the source (1) to the sink (7) by the Ford Fulkerson Method (You must use at least one backward arc in your calculations, show all your work and iterations) b) (10 points) Formulate problem as a MCNFP. (Write in matrix form) a ) Question 3 (25 points) Following table gives the mileage of the feasible links connecting the water well with the city center. To send the water, there exists five pumping stations and the following table shows the miles between the well, pumps, and city. The engineers want to determine the minimum pipeline network that links the well to the city center (The dashed lines mean there is no pipeline between these pumping stations) Miles between Adjacent Pumping Stations Town Pump 1 Pump 2 Pump 3 Pump 4 Pump 5 City Well 4 6 5 Pump 1 2 7 Pump 2 2 5.5 Pump3 5 Pump 4 1 6 Pump 5 8 a) (3 points) Draw the network. b) (12 points) Solve the problem with an appropriate algorithm. c) (10 points) Formulate the problem as a transshipment problem. Question 2 (20 points) Consider the following flow network 10 points) Find the flow pattern giving the maximum flow from the source (1) to the sink (7) by the Ford Folkerson Method [You must use at least one backward arc in your calculations, show all your work and iterations) (10 points) formulate problem as a MONIP. (Write in matrix form) Question 325 points) Following tableaves the mileage of the feasible links connecting the water well with the city center To send the water, there estive pumping stations and the following table how the miles between the well pumps and oty The engineers want to determine the minimum etwork that is the well to the city center (The dashed lines mean there is no pipeline between these pumping station Miles between Adjacent Pumping Stations CamScanner ile tara a) (10 points) Find the flow pattern giving the maximum flow from the source (1) to the sink (7) by the Ford Fulkerson Method (You must use at least one backward arc in your calculations, show all your work and iterations) b) (10 points) Formulate problem as a MCNFP. (Write in matrix form) a ) Question 3 (25 points) Following table gives the mileage of the feasible links connecting the water well with the city center. To send the water, there exists five pumping stations and the following table shows the miles between the well, pumps, and city. The engineers want to determine the minimum pipeline network that links the well to the city center (The dashed lines mean there is no pipeline between these pumping stations) Miles between Adjacent Pumping Stations Town Pump 1 Pump 2 Pump 3 Pump 4 Pump 5 City Well 4 6 5 Pump 1 2 7 Pump 2 2 5.5 Pump3 5 Pump 4 1 6 Pump 5 8 a) (3 points) Draw the network. b) (12 points) Solve the problem with an appropriate algorithm. c) (10 points) Formulate the problem as a transshipment