Problem of Maximum Flow & Minimum Cut Set of Network with Lower & Upper Arc Capacities

For convenience to build decision support system relative to the problem of maximum flow minimum cut set of network with lower upper arc capacities,a numerical algorithm for finding maximum flow minimum cut set in network with lower upper arc capacities,is proposed in this paper.The theory,on which the algorithm is based,is strictly proved.And the application of the algorithm to blocking flow theory is illustrated with an example. The algorithm can judge whether the problem has a feasible solution or not,which can find the optimal solution to the problem while a feasible solution exists,and has good performance in the sense of being implemented on computer,convergence,etc.Numerical experiments demonstrate that the algorithm is an efficient and robust method to solve the problem,which can still be used to solve the minimum saturated flow problem.