-

 

 

 




Optimization Online





 

Strengthened Bounds for the Probability of k-Out-Of-n Events

Feng Qiu(fqiu***at***gatech.edu)
Shabbir Ahmed(sahmed***at***isye.gatech.edu)
Santanu S. Dey(santanu.dey***at***isye.gatech.edu)

Abstract: Abstract: Given a set of n random events in a probability space, represented by n Bernoulli variables (not necessarily independent,) we consider the probability that at least k out of n events occur. When partial distribution information, i.e., individual 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 (Discrete Appl. Math. 145 (2005) 444) proposed a polynomial-size 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.

Keywords: linear programming, probability bound, k-of-n event

Category 1: Linear, Cone and Semidefinite Programming (Linear Programming )

Citation:

Download: [PDF]

Entry Submitted: 09/12/2013
Entry Accepted: 09/12/2013
Entry Last Modified: 09/12/2013

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society