Bounding the probability of the union of events by aggregation and disaggregation in linear programs
From MaRDI portal
Publication:1765524
DOI10.1016/j.dam.2004.03.003zbMath1107.60005OpenAlexW2038950164MaRDI QIDQ1765524
Publication date: 23 February 2005
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2004.03.003
Related Items (19)
New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributions ⋮ A-priori upper bounds for the set covering problem ⋮ Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs ⋮ On bounding the union probability using partial weighted information ⋮ Linear programming bounds on the union probability ⋮ Sharp probability bounds for the binomial moment problem with symmetry ⋮ Strengthened bounds for the probability of \(k\)-out-of-\(n\) events ⋮ Tight Probability Bounds with Pairwise Independence ⋮ Computing bounds for the probability of the union of events by different methods ⋮ On upper and lower bounds for probabilities of combinations of events ⋮ Lower Bounds on the Probability of a Finite Union of Events ⋮ Bounds for the probability of union of events following monotonic distribution ⋮ The effect of redundancy on probability bounds ⋮ On inequalities for probabilities of joint occurrence of several events ⋮ Sharp bounds for the probability of union of \(n\) events when \(m\) number of binomial moments are known ⋮ Bounds for probabilistic programming with application to a blend planning problem ⋮ Approximating two-stage chance-constrained programs with classical probability bounds ⋮ Polynomially Computable Bounds for the Probability of the Union of Events ⋮ Optimized Bonferroni approximations of distributionally robust joint chance constraints
Cites Work
- Unnamed Item
- Unnamed Item
- A lower bound on the probability of a union
- A lower bound on the probability of a finite union of events
- Sharp Bounds on Probabilities Using Linear Programming
- Boole-Bonferroni Inequalities and Linear Programming
- Closed Form Two-Sided Bounds for Probabilities that At Least r and Exactly r Out of n Events Occur
- Inequalities for the probability of the occurrence of at least m out of n events
- Best Linear Bonferroni Bounds
- Bounds on the probability of the union and intersection of m events
- An upper bound for the probability of a union
- Most Stringent Bounds on Aggregated Probabilities of Partially Specified Dependent Probability Systems
- Best Possible Inequalities for the Probability of a Logical Function of Events
- An Inequality for Probabilities
This page was built for publication: Bounding the probability of the union of events by aggregation and disaggregation in linear programs
