You are here

Home » Content

Sharp Bounds for the Probability of the Union of Events Under Unimodality Condition

Journal Name:

  • European Journal of Pure and Applied Mathematics

Publication Year:

  • 2008

Key Words:

Author Name

AMS Codes:

Abstract (2. Language): 
Linear programming problem is formulated for bounding the probability of the union of events, where the probability distribution of the occurrences is supposed to be unimodal with known mode and some of the binomial moments of the events are also known. Using a theorem on combinatorial determinants the dual feasible bases of a relaxed problem are fully described. The bounds for the probability of the union are presented in the form of formulas as well as the results of customized algorithmic solution of the LP’s involved.
Bookmark/Search this post with
FULL TEXT (PDF): 
PDF icon arastirmax-sharp-bounds-probability-union-events-under-unimodality-condition.pdf
  • 1
60-81
  • English

REFERENCES

References: 

[1] E. Boros, A. Pr´ekopa, Closed form two-sided bounds for probabilities that exactly r and at
least r out of n events occur. Math. Oper. Res., 14: 317–347 (1989).
[2] J. Buksz´ar, A. Pr´ekopa, Probability bounds with cherry trees. Math. Oper. Res., 26: 174–192
(2001).
[3] J. Buksz´ar, Hypermultitrees and Bonferroni Inequalities. Mathemtical Inequalities and Applications,
6: 727–745 (2003).
[4] D.A. Dawson, A. Sankoff, An inequality for probabilities. Proceedings of the American Mathematical
Society, 18: 504–507 (1967).
[5] J. Gessel, G. Viennot, Binomial determinants, paths, and hook length formulae. Advences in
Mathematics 58: 300–321 (1985).
[6] S.M. Kwerel, Most Stringent bounds on aggregated probabilities of partially specified dependent
probability systems. J. Amer. Stat. Assoc., 70: 472–479 (1975).
[7] A. Pr´ekopa, Boole-Bonferroni inequalities and linear programming. Operations Research 36:
145–162 (1988).
[8] A. Pr´ekopa, Totally positive linear programming problems, in L.V. Kantorovich Memorial Volume,
Oxford Univ. Press, New York, 197–207, 1989.
[9] A. Pr´ekopa, Sharp bounds on probabilities using linear programming. Operations Research,
38: 227–239 (1990).
[10] A. Pr´ekopa, The discrete moment problem and linear programming. Discrete Applied Mathematics
27: 235–254 (1990).
[11] A. Pr´ekopa, Stochastic Programming, Kluwer Academic Publishers, Dordtecht, Boston, 1995.
[12] A. Pr´ekopa, A brief introduction to linear programming. Math. Scientist 21: 85–111 (1996).
[13] A. Pr´ekopa, L. Gao, Bounding the probability of the union of events by the use of aggregation
and disaggregation in linear programs. Discrete Applied Mathematics 145: 444–454 (2005).
[14] E. Subasi, M. Subasi, A. Pr´ekopa, Discrete moment problems with distributions known to
be unimodal. Mathematical Inequalities and Applications, accepted. Available as RUTCOR
Research Report RRR 15-2007.

Thank you for copying data from http://www.arastirmax.com