Accession Number:

ADA158689

Title:

Computational Complexity of Coherent Systems and the Reliability Polynomial.

Descriptive Note:

Technical rept.,

Corporate Author:

CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER

Personal Author(s):

Report Date:

1985-07-01

Pagination or Media Count:

17.0

Abstract:

There are three general methods for system reliability evaluation, namely 1 Inclusion-Exclusion, 2 Sum of Disjoint Products, and 3 Pivoting. Of these, only pivoting can be applied directly to a logic tree or network graph representation without first finding minimal path or cut sets. Domination theory provides the basis for selecting optimal pivoting strategies. Simple proofs of domination theory results for coherent systems are given, based on the reliability polynomial. These results are related to the problem of finding efficient strategies for computing coherent system reliability. The original results for undirected networks are due to Satyanarayana and Chang 1983. Many of the original set theoretic results are due to Huseby 1984. However, he does not use the reliability polynomial to prove his results. Additional keywords Operations research. Author

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE