Bounds for the probability of the union of events with unimodality
作者： R. Swarnalatha , V. Kumaran
DOI: 10.1007/S10479-017-2629-6
关键词:
摘要: We consider the problem of finding sharp bounds for probability union n events via linear programming. The occurrences is supposed to be unimodal with known mode. Probability are found when first m $$\left( 2 \le n-1 \right) $$ out binomial moments known. Inverse class matrices corresponding dual feasible bases and it exploited find bounds.
springer.com
sci-hub.se 参考文章(22)
Merve Unuvar, Eren Erman Ozguven, András Prékopa, Optimal capacity design under k-out-of-n and consecutive k-out-of-n type probabilistic constraints Annals of Operations Research. ,vol. 226, pp. 643- 657 ,(2015) , 10.1007/S10479-014-1712-5
András Prékopa, The use of discrete moment bounds in probabilisticconstrained stochastic programming models Annals of Operations Research. ,vol. 85, pp. 21- 38 ,(1999) , 10.1023/A:1018921811281
Andra's Pre'kopa, Ersoy Subasi, Mine Subasi, Sharp Bounds for the Probability of the Union of Events Under Unimodality Condition European Journal of Pure and Applied Mathematics. ,vol. 1, pp. 60- 81 ,(2008)
D. A. Dawson, D. Sankoff, AN INEQUALITY FOR PROBABILITIES Proceedings of the American Mathematical Society. ,vol. 18, pp. 504- 507 ,(1967) , 10.1090/S0002-9939-1967-0211424-0
David Hunter, An upper bound for the probability of a union Journal of Applied Probability. ,vol. 13, pp. 597- 603 ,(1976) , 10.2307/3212481
Kai Lai Chung, Paul Erdös, On the application of the borel-cantelli lemma Transactions of the American Mathematical Society. ,vol. 72, pp. 179- 186 ,(1952) , 10.1090/S0002-9947-1952-0045327-5
Ersoy Subasi, Mine Subasi, András Prékopa, Discrete moment problems with distributions known to be unimodal Mathematical Inequalities & Applications. pp. 587- 610 ,(2009) , 10.7153/MIA-12-46
Endre Boros, András Prékopa, Probabilistic bounds and algorithms for the maximum satisfiability problem Annals of Operations Research. ,vol. 21, pp. 109- 126 ,(1989) , 10.1007/BF02022095
András Prékopa, Linchun Gao, Bounding the probability of the union of events by aggregation and disaggregation in linear programs Discrete Applied Mathematics. ,vol. 145, pp. 444- 454 ,(2005) , 10.1016/J.DAM.2004.03.003
József Bukszár, Gergely Mádi-Nagy, Tamás Szántai, Computing bounds for the probability of the union of events by different methods Annals of Operations Research. ,vol. 201, pp. 63- 81 ,(2012) , 10.1007/S10479-012-1231-1