Bounding the Probability of the Union of Events by the Use of Aggregation and Disaggregation in Linear Programs

@inproceedings{Gao2011BoundingTP,
  title={Bounding the Probability of the Union of Events by the Use of Aggregation and Disaggregation in Linear Programs},
  author={Linchun Gao},
  year={2011}
}
Given a sequence of n arbitrary events in a probability space we as sume that the individual probabilities as well as some or all joint probabilities of up to m events are known where m n Using this information we give lower and upper bounds for the probability of the union The bounds are obtained as optimum values of linear programming problems or objective function values corre sponding to feasible solutions of the dual problems If all joint probabilities of the k tuples of events are known… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 27 references

Rrr

RRR • 2001

Bounds on Probabilities and Expectations Using Multivariate Moments of Discrete Distributions

A Pr Ekopa
Studia Sci. Math. Hung • 1998

A brief introduction to linear programming

A Pr Ekopa
Math. Scientist • 1996

Bonferroni-type inequalities with applications

J Galambos, J Simonelli
Bonferroni-type inequalities with applications • 1996

Stochastic programming

A Pr Ekopa
Stochastic programming • 1995

Inequalities on expectations based on the knowledge of multivariate moments

A Pr Ekopa
Institute of Mathematical Statistics • 1992

Reliability of Computer and CommunicationNetworks , DIMACS Series in Discrete Mathematics and Theoretical Computer Science

F Roberts, F Hwang, C Monma
Reliability of Computer and CommunicationNetworks , DIMACS Series in Discrete Mathematics and Theoretical Computer Science • 1991

Similar Papers

Loading similar papers…