caa a22 4500 386350582 CHVBK 20180307111827.0 cr unu---uuuuu 161130e198904 xx s 000 0 eng 10.1017/S0269964800001078 doi S0269964800001078 pii (NATIONALLICENCE)cambridge-10.1017/S0269964800001078 Yao Y. C. Department of Statistics Colorado State University Fort Collins, Colorado 80523 On Optimal Consecutive k-out-of-n: F Systems Subject to a Fixed Product of Failure Probabilities [Elektronische Daten] [Y. C. Yao] 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. Copyright © Cambridge University Press 1989 Probability in the Engineering and Informational Sciences Cambridge University Press 3/2(1989-04), 165-173 0269-9648 3:2<165 1989 3 PES https://doi.org/10.1017/S0269964800001078 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1017/S0269964800001078 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Yao Y. C. Department of Statistics Colorado State University Fort Collins, Colorado 80523 NATIONALLICENCE 773 0- Probability in the Engineering and Informational Sciences Cambridge University Press 3/2(1989-04), 165-173 0269-9648 3:2<165 1989 3 PES CC0 http://creativecommons.org/publicdomain/zero/1.0 nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-cambridge