Improved bounds on the probability of the union of events some of whose intersections are empty
DOI10.1016/J.ORL.2015.10.004zbMATH Open1408.90217OpenAlexW2122303817MaRDI QIDQ1785461FDOQ1785461
Authors: Kunikazu Yoda, András Prékopa 
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
Recommendations
- scientific article; zbMATH DE number 3930023
- Lower Bounds for the Probability of Intersection of Several Unions of Events
- scientific article; zbMATH DE number 1748521
- New Bounds of the Probability of a Union
- Lower bounds on the probability of a finite union of events
- Bounds for probabilities of unions of events and the Borel-Cantelli lemma
- A generalization of the Chung-Erdős inequality for the probability of the union of events
- A lower bound on the probability of a finite union of events
- Sharp bounds for the probability of the union of events under unimodality condition
- A lower bound on the probability of a union
Inequalities; stochastic orderings (60E15) Reliability, availability, maintenance, inspection in operations research (90B25) Stochastic programming (90C15) Communication networks in operations research (90B18)
Cites Work
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Most Stringent Bounds on Aggregated Probabilities of Partially Specified Dependent Probability Systems
- An Inequality for Probabilities
- The discrete moment problem and linear programming
- Probabilistic bounds and algorithms for the maximum satisfiability problem
- Title not available (Why is that?)
- Best Possible Inequalities for the Probability of a Logical Function of Events
- On the Method of Inclusion and Exclusion
- Optimal capacity design under \(k\)-out-of-\(n\) and consecutive \(k\)-out-of-\(n\) type probabilistic constraints
- Title not available (Why is that?)
Cited In (19)
- On the probability of union in the $n$-space
- Improved Chen-Stein bounds on the probability of a union
- New Bounds of the Probability of a Union
- Title not available (Why is that?)
- Bounding the probability of the union of events by aggregation and disaggregation in linear programs
- Tight Probability Bounds with Pairwise Independence
- Polynomially computable bounds for the probability of the union of events
- Sharp bounds for the probability of the union of events under unimodality condition
- Graph-based upper bounds for the probability of the union of events
- New upper bounds on the probability of events based on graph structures
- Bounds for probabilistic programming with application to a blend planning problem
- Title not available (Why is that?)
- New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributions
- Improving probability bounds by optimization over subsets
- Fréchet optimal bounds on the probability of a union with supplementary information
- Sharp bounds for the probability of union of \(n\) events when \(m\) number of binomial moments are known
- Sharp probability bounds for the binomial moment problem with symmetry
- Lower bounds on the probability of a finite union of events
- The value of shape constraints in discrete moment problems: a review and extension
Uses Software
This page was built for publication: Improved bounds on the probability of the union of events some of whose intersections are empty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785461)
