An algorithm to generate all upper boundary points for (d,B) in terms of minimal cuts

AbstractThis paper discusses a stochastic-flow network from single-commodity case to multicommodity case. We propose a performance index, namely the probability that the upper bound of the system capacity is a given vector subject to the budget constraint, to evaluate the quality level for such a network. A simple approach based on minimal cuts is presented to generate the all upper boundary points for the demand d subject to the budget B in order to evaluate the performance index