Strengthened bounds for the probability of k-out-of-n events

被引:4
|
作者
Qiu, Feng [1 ]
Ahmed, Shabbir [1 ]
Dey, Santanu S. [1 ]
机构
[1] Georgia Inst Technol, Sch Ind & Syst Engn, Atlanta, GA 30332 USA
基金
美国国家科学基金会;
关键词
Linear programming; Probability bound; k-of-n event; UNION; INTERSECTION;
D O I
10.1016/j.dam.2015.05.023
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Given a set of n random events in a probability space, represented by n Bernoulli variables necessarily independent), we consider the probability that at least k out of n events occur. When partial distribution information, i.e., marginal probabilities and all joint probabilities of up to m (m < n) events, are provided, only an upper or lower bound can be computed for this probability. Recently Prekopa and Gao (2005) proposed a polynomialsize linear program to obtain strong bounds for the probability of union of events, i.e., k = 1. In this work, we propose inequalities that can be added to this linear program to strengthen the bounds. We also show that with a slight modification of the objective function this linear program and the inequalities can be used for the more general case where k is any positive integer less than or equal to n. We use the strengthened linear program to compute probability bounds for the examples used by Prekopa and Gao, and the comparison shows significant improvement in the bound quality. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:232 / 240
页数:9
相关论文
共 50 条
  • [41] OPTIMAL REPAIR STAGE FOR K-OUT-OF-N SYSTEMS
    VENUGOPAL, N
    AHAMED, SS
    REDDY, CR
    MICROELECTRONICS AND RELIABILITY, 1989, 29 (01): : 17 - 19
  • [42] Failure rates of consecutive k-out-of-n systems
    Serkan Eryılmaz
    Jorge Navarro
    Journal of the Korean Statistical Society, 2012, 41 : 1 - 11
  • [43] COMPUTING K-OUT-OF-N SYSTEM RELIABILITY.
    Barlow, R.E.
    Heidtmann, K.D.
    1600, (R-33):
  • [44] On a generalized k-out-of-n system and its reliability
    Cui, LR
    Xie, M
    INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2005, 36 (05) : 267 - 274
  • [45] Design and Analysis of "Flexible" k-out-of-n Signatures
    Tso, Raylin
    Yi, Xun
    Ito, Tadahiko
    Okamoto, Takeshi
    Okamoto, Eiji
    AUTONOMIC AND TRUSTED COMPUTING, 2010, 6407 : 255 - +
  • [46] Dynamic behavior of k-out-of-n:G systems
    Eryilmaz, Serkan
    OPERATIONS RESEARCH LETTERS, 2011, 39 (02) : 155 - 159
  • [47] K-OUT-OF-N - G-SYSTEMS ARE PREFERABLE
    PHILLIPS, MJ
    IEEE TRANSACTIONS ON RELIABILITY, 1980, 29 (02) : 166 - 169
  • [48] THE EFFICIENCY OF COMPUTING THE RELIABILITY OF K-OUT-OF-N SYSTEMS
    PHAM, H
    UPADHYAYA, SJ
    IEEE TRANSACTIONS ON RELIABILITY, 1988, 37 (05) : 521 - 523
  • [49] Nonparametric inference for sequential k-out-of-n systems
    Eric Beutner
    Annals of the Institute of Statistical Mathematics, 2008, 60 : 605 - 626
  • [50] On the profust reliabilities of consecutive k-out-of-n systems
    Mert, A. (ali.mert@ege.edu.tr), 1600, SAGE Publications Ltd (228):