Computing bounds for the probability of the union of events by different methods

DOI10.1007/s10479-012-1231-1zbMath1263.60017OpenAlexW2047319308MaRDI QIDQ1945070

József Bukszár, Gergely Mádi-Nagy, Tamás Szántai

Publication date: 2 April 2013

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-012-1231-1

zbMATH Keywords

linear programminghypergraphsexpectation boundsprobability boundsnetwork reliabilitydiscrete moment problemmultivariate distribution function

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Computational methods for problems pertaining to probability theory (60-08) Linear programming (90C05)

Related Items (6)

New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributions ⋮ Complexity of some graph-based bounds on the probability of a union of 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 ⋮ The value of shape constraints in discrete moment problems: a review and extension ⋮ Optimized Bonferroni approximations of distributionally robust joint chance constraints

Uses Software

• QSIMVN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The discrete moment problem and linear programming
• Upper bounds of degree 3 for the probability of the union of events via linear programming
• Hypertrees and Bonferroni inequalities
• Bonferroni inequalities
• A lower bound on the probability of a union
• Improved Bonferroni inequalities via abstract tubes. Inequalities and identities of inclusion-exclusion type
• Inequalities on expectations based on the knowledge of multivariate moments
• Bounding the probability of the union of events by aggregation and disaggregation in linear programs
• On numerical calculation of probabilities according to Dirichlet distribution
• A lower bound on the probability of a finite union of events
• Upper bounds for the probability of a union by multitrees
• Probability Bounds with Cherry Trees
• Bonferroni-type inequalities
• Sharp Bounds on Probabilities Using Linear Programming
• Bonferroni-type inequalities and the methods of indicators and polynomials
• On Multivariate Discrete Moment Problems: Generalization of the Bivariate Min Algorithm for Higher Dimensions
• A note on the background of several Bonferroni–Galambos-type inequalities
• 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
• An improved Bonferroni inequality and applications
• 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
• Methods for Proving Bonferroni Type Inequalities
• Hypermultitrees and sharp Bonferroni inequalities
• Probability bounds given by hypercherry trees
• A method to find the best bounds in a multivariate discrete moment problem if the basis structure is given
• Best Possible Inequalities for the Probability of a Logical Function of Events
• An Inequality for Probabilities
• Bounds for the Probability of a Union, with Applications
• On Multivariate Discrete Moment Problems and Their Applications to Bounding Expectations and Probabilities
• On the Application of the Borel-Cantelli Lemma
• Improved bounds and simulation procedures on the value of the multivariate normal probability distribution function

This page was built for publication: Computing bounds for the probability of the union of events by different methods