Bounding the probability of the union of events by aggregation and disaggregation in linear programs
type: Item
instance of: scholarly article
title: Bounding the probability of the union of events by aggregation and disaggregation in linear programs
zbMATH Open document ID: 1107.60005
author: Linchun Gao
author: András Prékopa
published in: Discrete Applied Mathematics
publication date: 2005-02-23T00:00:00Z
Mathematics Subject Classification ID: 60C05
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 2137494
zbMATH Keywords: Inequalities
zbMATH Keywords: Linear programming
zbMATH Keywords: Reliability
zbMATH Keywords: Applications in probability theory and statistics
MaRDI profile type: Publication
full work available at URL: j.dam.2004.03.003
OpenAlex ID: W2038950164
cites work: Closed Form Two-Sided Bounds for Probabilities that At Least r and Exactly r Out of n Events Occur
cites work: An Inequality for Probabilities
cites work: A lower bound on the probability of a union
cites work: Best Possible Inequalities for the Probability of a Logical Function of Events
cites work: An upper bound for the probability of a union
cites work: Best Linear Bonferroni Bounds
cites work: A lower bound on the probability of a finite union of events
cites work: Most Stringent Bounds on Aggregated Probabilities of Partially Specified Dependent Probability Systems
cites work: Bounds on the probability of the union and intersection of m events
cites work: Boole-Bonferroni Inequalities and Linear Programming
cites work: Sharp Bounds on Probabilities Using Linear Programming
cites work: Q3126752
cites work: Q4332536
cites work: Inequalities for the probability of the occurrence of at least m out of n events
DOI: 10.1016/J.DAM.2004.03.003
description: scientific article; zbMATH DE number 2137494