Boole’s Probability Bounding Problem, Linear Programming Aggregations, and Nonnegative Quadratic Pseudo-Boolean Functions

References

• [1] Boole G (1854) Laws of Thought, American reprint of 1854 edition (Dover, New York).Google Scholar
• [2] Boole G (1868) Of Propositions Numerically Definite. Transactions of Cambridge Philosophical Society, Part II, XI (Cambridge University Press, Cambridge, UK).Google Scholar
• [3] Boole G (1952) Collected Logical Works, Vol I, Studies in Logic and Probability (Open Court Publ. Co., LaSalle, IL).Google Scholar
• [4] Boros E, Hammer PL (2002) Pseudo-Boolean optimization. Discrete Appl. Math. 123(1):155–225.Crossref, Google Scholar
• [5] Boros E, Prékopa A (1989) Closed form two-sided bounds for probabilities that at least r and exactly r out of n events occur. Math. Oper. Res. 14(2):317–342.Link, Google Scholar
• [6] Boros E, Crama Y, Hammer P (1990) Upper-bounds for quadratic 0–1 maximization. Oper. Res. Lett. 9(2):73–79.Crossref, Google Scholar
• [7] Boros E, Crama Y, Hammer PL (1992) Chvátal cuts and odd cycle inequalities in quadratic 0–1 optimization. SIAM J. Discrete Math. 5(2):163–177.Crossref, Google Scholar
• [8] Boros E, Scozzari A, Tardella F, Veneziani P (2014) Polynomially computable bounds for the probability of the union of events. Math. Oper. Res. 39(4):1311–1329.Link, Google Scholar
• [9] Chung K, Erdős P (1952) On the application of the Borel-Cantelli lemma. Trans. Amer. Math. Soc. 72:179–186.Crossref, Google Scholar
• [10] Dawson DA, Sankoff D (1967) An inequality for probabilities. Proc. Amer. Math. Soc. 18:504–504.Crossref, Google Scholar
• [11] DeCaen D (1997) A lower bound on the probability of a union. Discrete Math. 169(1–3):217–220.Crossref, Google Scholar
• [12] DeSimone C (1990) The cut polytope and the Boolean quadric polytope. Discrete Math. 79(1):71–75.Crossref, Google Scholar
• [13] Deza M, Laurent M (1992) Facets for the cut cone I. Math. Programming Ser. A. 56:121–160.Crossref, Google Scholar
• [14] Deza M, Laurent M (1992) Facets for the cut cone II: Clique-web inequalities. Math. Programming Ser. A. 56:161–188.Crossref, Google Scholar
• [15] Deza MM, Laurent M (1997) Geometry of Cuts and Metrics (Springer-Verlag, Berlin).Crossref, Google Scholar
• [16] Galambos J (1977) Bonferroni inequalities. Ann. Probab. 5(4):577–581.Crossref, Google Scholar
• [17] Grishukin VP (1990) All facets of the cut cone for n = 7 are known. Eur. J. Combin. 11(2):115–117.Crossref, Google Scholar
• [18] Hailperin T (1965) Best possible inequalities for the probability of a logical function of events. Amer. Math. Monthly 72(4):343–359.Crossref, Google Scholar
• [19] Hansen P, Jaumard B, Nguetse GD (1999) Best second order bounds for two-terminal network reliability with dependent edge failures. Discrete Appl. Math. 96–97:375–393.Crossref, Google Scholar
• [20] Hoppe F, Seneta E (1990) Bonferroni-type inequalities and the methods of indicators and polynomials. Adv. Appl. Probab. 22(1):241–246.Crossref, Google Scholar
• [21] Jaumard B, Hansen P, de Aragão MP (1991) Column generation methods for probabilistic logic. J. Comput. 3(2):135–148.Google Scholar
• [22] Kavvadias D, Papadimitriou CH (1990) A linear programming approach to reasoning about probabilities. Ann. Math. Artif. Intell. 1:189–205.Crossref, Google Scholar
• [23] Kuai H, Alajaji F, Takahara G (2000) A lower bound on the probability of a finite union of events. Discrete Math. 215(1):147–158.Crossref, Google Scholar
• [24] Kwerel SM (1975) Bounds on probability of a union and intersection of m events. Adv. Appl. Probab. 7(2):431–448.Crossref, Google Scholar
• [25] Kwerel SM (1975) Most stringent bounds on aggregated probabilities of partially specified dependent probability systems. J. Amer. Statist. Assoc. 70(350):472–479.Crossref, Google Scholar
• [26] Prékopa A (1988) Boole-Bonferroni inequalities and linear programming. Oper. Res. 36(1):145–162.Link, Google Scholar
• [27] Prékopa A, Gao L (2005) Bounding the probability of the union of events by aggregation and disaggregation in linear programs. Discrete Appl. Math. 145(3):444–454.Crossref, Google Scholar
• [28] Qiu F, Ahmed S, Dey SS (2016) Strengthened bounds for the probability of k-out-of-n events. Discrete Appl. Math. 198:232–240.Crossref, Google Scholar
• [29] Sathe YS, Pradhan M, Shah SP (1980) Inequalities for the probability of the occurrence of at least m out of n events. J. Appl. Probab. 17(4):1127–1132.Crossref, Google Scholar
• [30] Yang J, Alajaji F, Takahara G (2016) Lower bounds on the probability of a finite union of events. SIAM J. Discrete Math. 30(3):1437–1452.Crossref, Google Scholar
• [31] Yang J, Alajaji F, Takahara G (2016) On bounding the union probability using partial weighted information. Statist. Probab. Lett. 116:38–44.Crossref, Google Scholar
• [32] Yang J, Alajaji F, Takahara G (2017) A short survey on bounding the union probability using partial information. Preprint, submitted October 20, https://arxiv.org/abs/1710.07576.Google Scholar
• [33] Yang J, Alajaji F, Takahara G (2019) Linear programming bounds on the union probability. Comm. Statist. Simulation Comput. 48(9):2845–2854.Crossref, Google Scholar