Network problem, Operation Research

Consider the following network where the value on each arc represents the capacity of that arc. Use the augmenting path algorithm to find the value of the maximum flow from node 1 to node 6. 

 

974_network-problem.png

Posted Date: 6/30/2012 8:18:17 AM | Location : United States







Related Discussions:- Network problem, Assignment Help, Ask Question on Network problem, Get Answer, Expert's Help, Network problem Discussions

Write discussion on Network problem
Your posts are moderated
Related Questions
This method is more  systematic and orderly than least cost method. Here penalties for each column and row of the transportation table are determined, and the row  or  column with

b. A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y pape

AI TECHNOLOGY''S CURRENT AND POTENTIAL FUTURE APPLICATIONS

Disadvantage  of standard Deviation It is not  easy  to understand  and calculate. It gives  more  weight  to the extremes  and less  to the items   nearer to mean. Since

mile-high microbrewery makes a light beer and a dark beer. mile-high has a limited supply of barley, limited bottling capacity, and a limited market for light beer. profits are $0.

Maximize Z = 2x - 7y subject -2x + 3y = 3 4x + 5y >= 10 6x + 7y 4x + 8y >= 5

3. A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y pape

a)Draw a network for the project. b)Determine the critical path. Activity Duration Activity Duration 1-2 15 5-10 22 1-3 13 6-9 33 1-4 1

One Sample sign Test In a one  sample  test the  null  hypothesis μ = μ 0 against an  appropriate alternative on the basis of a random sample of size n we replace each sam

Problems based on LPP when feasible region is unbounded.     1.    Minimize z = 3x + 5y subject to constraints  X + y ≥ 2 X + 3y ≥ 3 X, y ≥ 0 script