Sharp bounds for the probability of union of n events when m number of binomial moments are known
DOI10.1007/S11081-019-09442-5zbMATH Open1431.90100OpenAlexW2952549133MaRDI QIDQ2303530FDOQ2303530
Authors: V. Kumaran, R. Swarnalatha 
Publication date: 4 March 2020
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-019-09442-5
Recommendations
- Bounds for the probability of union of events following monotonic distribution
- Sharp bounds for the probability of the union of events under unimodality condition
- Sharp Bounds on Probabilities Using Linear Programming
- Bounding the probability of the union of events by aggregation and disaggregation in linear programs
- Computing bounds for the probability of the union of events by different methods
Linear programming (90C05) Inequalities; stochastic orderings (60E15) Stochastic programming (90C15) Theory of matrix inversion and generalized inverses (15A09)
Cites Work
- Bounding the probability of the union of events by aggregation and disaggregation in linear programs
- On the relationship between the discrete and continuous bounding moment problems and their numerical solutions
- Discrete moment problems with distributions known to be unimodal
- 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
- Most Stringent Bounds on Aggregated Probabilities of Partially Specified Dependent Probability Systems
- Title not available (Why is that?)
- Polynomially computable bounds for the probability of the union of events
- An Inequality for Probabilities
- On the Application of the Borel-Cantelli Lemma
- Probabilistic bounds and algorithms for the maximum satisfiability problem
- An upper bound for the probability of a union
- Inequalities for the probability of the occurrence of at least m out of n events
- Computing bounds for the probability of the union of events by different methods
- Improved bounds on the probability of the union of events some of whose intersections are empty
- Optimal capacity design under \(k\)-out-of-\(n\) and consecutive \(k\)-out-of-\(n\) type probabilistic constraints
- Sharp bounds for the probability of the union of events under unimodality condition
- Lower and upper bounds for the probability that at least r and exactly r out of n events occur
- Bounds for the probability of union of events following monotonic distribution
- 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
Cited In (1)
This page was built for publication: Sharp bounds for the probability of union of \(n\) events when \(m\) number of binomial moments are known
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2303530)
