Article contents
On Optimal Consecutive k-out-of-n: F Systems Subject to a Fixed Product of Failure Probabilities
Published online by Cambridge University Press: 27 July 2009
Extract
A consecutive−k−out−of−n:F system is an n−vertex graph where the system fails if and only if some k consecutive vertices all fail. Assuming that the n vertices have, independently, the respective failure probabilities q1,…, qn, the problem is to find, subject to πqi = Q (a constant), a set of q1,…, qn so as to maximize the system reliability. In the case that the graph is a circle (or cycle), Chang and Hwang [1] conjectured that q1 =… = qn, = Q1/n is optimal if n and k are relatively prime. In this paper, it is shown that the conjecture is true for sufficiently small Q. It is also shown by counterexample that the conjecture is not true in general.
- Type
- Articles
- Information
- Probability in the Engineering and Informational Sciences , Volume 3 , Issue 2 , April 1989 , pp. 165 - 173
- Copyright
- Copyright © Cambridge University Press 1989
References
REFERENCES
- 1
- Cited by