Article contents
A NOTE ON TWO RELIABILITY LOWER BOUNDS FOR MULTISTATE SYSTEMS
Published online by Cambridge University Press: 10 October 2002
Abstract
Maymin proved that for binary systems, the path-cut lower bound is sharper than the minimax lower bound for highly reliable components, which was originally conjectured by Barlow and Proschan. In this note, an example is constructed to illustrate that this, in general, is not the case for multistate systems. However, an affirmative result is obtained under mild conditions we imposed. Examples are given to illustrate the applications of our results.
- Type
- Research Article
- Information
- Probability in the Engineering and Informational Sciences , Volume 16 , Issue 4 , October 2002 , pp. 485 - 498
- Copyright
- © 2002 Cambridge University Press
- 2
- Cited by