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

zbMATH Keywords

matrix inversediscrete moment problembinomial moment

Mathematics Subject Classification ID

Linear programming (90C05) Inequalities; stochastic orderings (60E15) Stochastic programming (90C15) Theory of matrix inversion and generalized inverses (15A09)

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

Cites work

• scientific article; zbMATH DE number 772850 (Why is no real title available?)
• An Inequality for Probabilities
• An upper bound for the probability of a union
• Boole-Bonferroni Inequalities and Linear Programming
• Bounding the probability of the union of events by aggregation and disaggregation in linear programs
• Bounds for the probability of union of events following monotonic distribution
• Closed Form Two-Sided Bounds for Probabilities that At Least r and Exactly r Out of n Events Occur
• Computing bounds for the probability of the union of events by different methods
• Discrete moment problems with distributions known to be unimodal
• Improved bounds on the probability of the union of events some of whose intersections are empty
• Inequalities for the probability of the occurrence of at least m out of n events
• Lower and upper bounds for the probability that at least r and exactly r out of n events occur
• Most Stringent Bounds on Aggregated Probabilities of Partially Specified Dependent Probability Systems
• New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributions
• On the Application of the Borel-Cantelli Lemma
• On the relationship between the discrete and continuous bounding moment problems and their numerical solutions
• Optimal capacity design under \(k\)-out-of-\(n\) and consecutive \(k\)-out-of-\(n\) type probabilistic constraints
• Polynomially computable bounds for the probability of the union of events
• Probabilistic bounds and algorithms for the maximum satisfiability problem
• Sharp bounds for the probability of the union of events under unimodality condition
• Sharp probability bounds for the binomial moment problem with symmetry

Cited in

(2)

• Bounds for the probability of union of events following monotonic distribution
• A sharp upper probability bound for the occurrence of at least m out of n events

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)