Reliability analysis for limited-flow networks with budget constraints

Many real-world systems such transportation systems and manufacturing systems can be regarded as flow networks whose arcs have independent, finite and multi-valued random capacities. Such a Limited-now network is a multistate system with multistate components and its reliability for level (d,c) can be evaluated in terms of lower boundary points of level (d,c) (denoted (d,c)-MPs here). The main objective of this paper is to present a simple algorithm to generate all (d,c)-MPs of such a network for each level (d,c) in terms of minimal pathsets.