The effect of redundancy on probability bounds

DOI10.1016/j.disc.2007.12.052zbMath1155.60008OpenAlexW2022293262MaRDI QIDQ998500

Fred M. Hoppe

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.052

zbMATH Keywords

linear programmingprobability boundredundant event

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Linear programming (90C05)

Related Items (3)

On bounding the union probability using partial weighted information ⋮ Upper and lower bounds of Borel–Cantelli Lemma in a general measure space ⋮ Lower Bounds on the Probability of a Finite Union of Events

Cites Work

• Bounding the probability of the union of events by aggregation and disaggregation in linear programs
• A lower bound on the probability of a finite union of events
• Improving probability bounds by optimization over subsets
• On explicit and Fréchet-optimal lower bounds
• Boole-Bonferroni Inequalities and Linear Programming
• A lower bound using Hamilton-type circuits and its applications
• An Inequality for Probabilities

This page was built for publication: The effect of redundancy on probability bounds