Hostname: page-component-7dd5485656-6kn8j Total loading time: 0 Render date: 2025-10-30T19:21:27.386Z Has data issue: false hasContentIssue false
  • English
  • Français

A NOTE ON TWO RELIABILITY LOWER BOUNDS FOR MULTISTATE SYSTEMS

Published online by Cambridge University Press:  10 October 2002

Fan C. Meng
Fan C. Meng
Affiliation:
Institute of Statistical Science, Academia Sinica, Taipei, Taiwan, E-mail: fcmeng@stat.sinica.edu.tw
Get access Rights & Permissions [Opens in a new window]

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.

Information

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

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable