The paper applies the minimal cuts approach to propose a simple algorithm to generate all the minimal cuts (d, B)-MCs that meet the demand d and B, the budget constraint of the networlv. The paper shows that the system unreliability can be computed in terms of all the (d, B)-MCs. The proposed algorithm uses only the comparison concept to directly generate all the d-MCs without applying the maximum flow algorithm. The argorithm IS simpleF to understand and to program on a digital computer. The method is illustrated with a numerical example. (23 refs.)
展开▼
