Strengthened bounds for the probability of \(k\)-out-of-\(n\) events

DOI10.1016/j.dam.2015.05.023zbMath1397.60022OpenAlexW2212305991MaRDI QIDQ897611

Santanu S. Dey, Shabbir Ahmed, Feng Qiu

Publication date: 7 December 2015

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

Full work available at URL: https://doi.org/10.1016/j.dam.2015.05.023

zbMATH Keywords

linear programmingprobability bound\(k\)-of-\(n\) event

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial probability (60C05)

Related Items (1)

Tight Probability Bounds with Pairwise Independence

Cites Work

• Bounding the probability of the union of events by aggregation and disaggregation in linear programs
• 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
• Most stringent bounds on the probability of the union and intersection of m events for systems partially specified by s₁, s₂, …s_k, 2 ≦ k < m
• Bounds on the probability of the union and intersection of m events
• Polynomially Computable Bounds for the Probability of the Union of Events
• Probabilistic Set Covering with Correlations
• An Inequality for Probabilities

This page was built for publication: Strengthened bounds for the probability of \(k\)-out-of-\(n\) events