Scribd
Upload
26 views

Network Problem Figure 19

Solution to Network Problem Figure 18

Uploaded by

Jamie-Ché Newsome
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
26 views

Network Problem Figure 19

Solution to Network Problem Figure 18

Uploaded by

Jamie-Ché Newsome
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 5
Problem Figures 19 show the networks for Problem. Find the maximum flow from source to sink in the network. Find a cut in the network whose capacity equals the maximum flow in the network. Also, set up an LP that could be used to determine the maximum flow in the network. FIGURE 19 Network for Problem 2 Step-by-step solution Step 1/4 a The LP that can be used to determine the maximum flow in the network is given below. max z = x, ‘Such that, Kyu $2 x) $4 X83 ey) Xy SI wy $2 X31 0.3 S X=, +4, (for node so) Xogy = Si + ig (for node) iz =%y +%,, (for node 2) Xyy +X =%,y (for node3) (for node si) all variables 2 0 Fy thy Step 2/4 “aA We begin with a flow of zero through each arc. Label the sink by (s0,1)=(1,2)-(2,3)-(,si)_ We can increase flow in each arc by ‘one unit, obtaining the following feasible flow. flow 1 | 0 | [1 | | 0 | [1 | | 0 | 1 1 flow to sink Step 3/4 A Next label the sink by (s0,1)-(1,2)-(2.51) ang increase the flow in each of these arcs by 1 unit. The following feasible flow is obtained. arc flow so-l so-3 1-2 l-si 2-3 2-si 3-si flow to sink »|-|-|- 7 fe » Step 4/4 A Now label the sink by (593)-(355!) and increase the flow in each of these arcs by 1 unit. The following feasible flow is obtained. are flow so=l 2 so-3 1 1-2 2 l-si 0 2-3 1 2-si 1 3-si 2 flow to sink | 3 Now the sink cannot be labeled anymore. So a maximal flow is obtained. ¥' =(1,2.3.8i) vieids the minimal cut (ates (50.1) and (033)) vith a capacity of, = maximal flow

You might also like