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.
Publisher
Cambridge University Press (CUP)
Subject
Industrial and Manufacturing Engineering,Management Science and Operations Research,Statistics, Probability and Uncertainty,Statistics and Probability
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献