Improved bounds on the probability of the union of events some of whose intersections are empty

DOI10.1016/j.orl.2015.10.004zbMath1408.90217OpenAlexW2122303817MaRDI QIDQ1785461

Kunikazu Yoda, Prékopa, András

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2015.10.004

zbMATH Keywords

probability boundsmaximum independent set problemempty intersectionsunion of events

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Communication networks in operations research (90B18) Stochastic programming (90C15) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (6)

New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributions ⋮ Sharp probability bounds for the binomial moment problem with symmetry ⋮ Tight Probability Bounds with Pairwise Independence ⋮ 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 ⋮ The value of shape constraints in discrete moment problems: a review and extension

Uses Software

• Gurobi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The discrete moment problem and linear programming
• Probabilistic bounds and algorithms for the maximum satisfiability problem
• Optimal capacity design under \(k\)-out-of-\(n\) and consecutive \(k\)-out-of-\(n\) type probabilistic constraints
• 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
• On the Existence of a Feasible Flow in a Stochastic Transportation Network
• 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
• On the Method of Inclusion and Exclusion

This page was built for publication: Improved bounds on the probability of the union of events some of whose intersections are empty