Sharp Bounds for the Probability of the Union of Events Under Unimodality Condition
Keywords:
Binomial moment problem, linear programming, bounding probabilities, discrete unimodality, reliabilityAbstract
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 withknown 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 LPs involved.
Downloads
Issue
Section
Mathematical Analysis
License
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.
How to Cite
Sharp Bounds for the Probability of the Union of Events Under Unimodality Condition. (2007). European Journal of Pure and Applied Mathematics, 1(1), 60-81. https://www.ejpam.com/index.php/ejpam/article/view/87