{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T03:11:57Z","timestamp":1772939517098,"version":"3.50.1"},"reference-count":33,"publisher":"Institute for Operations Research and the Management Sciences (INFORMS)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematics of OR"],"published-print":{"date-parts":[[2026,1]]},"abstract":"<jats:p>Hailperin (1965) introduced a linear programming formulation to a difficult family of problems, originally proposed by Boole (1854, 1868). Hailperin\u2019s model is computationally still difficult and involves an exponential number of variables (in terms of a typical input size for Boole\u2019s problem). Numerous papers provided efficiently computable bounds for the minimum and maximum values of Hailperin\u2019s model by using aggregation that is a monotone linear mapping to a lower dimensional space. In many cases the image of the positive orthant is a subcone of the positive orthant in the lower dimensional space, and thus including some of the defining inequalities of this subcone can tighten up such an aggregation model, and lead to better bounds. Improving on some recent results, we propose a hierarchy of aggregations for Hailperin\u2019s model and a generic approach for the analysis of these aggregations. We obtain complete polyhedral descriptions of the above mentioned subcones and obtain significant improvements in the quality of the bounds.<\/jats:p>","DOI":"10.1287\/moor.2023.0019","type":"journal-article","created":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T08:47:48Z","timestamp":1738140468000},"page":"134-148","source":"Crossref","is-referenced-by-count":1,"title":["Boole\u2019s Probability Bounding Problem, Linear Programming Aggregations, and Nonnegative Quadratic Pseudo-Boolean Functions"],"prefix":"10.1287","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8206-3168","authenticated-orcid":false,"given":"Endre","family":"Boros","sequence":"first","affiliation":[{"name":"RUTCOR and MSIS Department, Rutgers Business School, Rutgers University, Piscataway, New Jersey 08854"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8595-8493","authenticated-orcid":false,"given":"Joonhee","family":"Lee","sequence":"additional","affiliation":[{"name":"Management and Management Science Department, Lubin School of Business, Pace University, New York, New York 10038"}]}],"member":"109","reference":[{"key":"B1","unstructured":"Boole G (1854)\n                      Laws of Thought\n                      , American reprint of 1854 edition (Dover, New York)."},{"key":"B2","volume-title":"Of Propositions Numerically Definite. Transactions of Cambridge Philosophical Society, Part II, XI","author":"Boole G","year":"1868"},{"key":"B3","volume-title":"Collected Logical Works, Vol I, Studies in Logic and Probability","author":"Boole G","year":"1952"},{"key":"B4","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00341-9"},{"key":"B5","doi-asserted-by":"publisher","DOI":"10.1287\/moor.14.2.317"},{"key":"B6","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(90)90044-6"},{"key":"B7","doi-asserted-by":"publisher","DOI":"10.1137\/0405014"},{"key":"B8","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2014.0657"},{"key":"B9","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1952-0045327-5"},{"key":"B10","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1967-0211424-0"},{"key":"B11","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(96)00107-0"},{"key":"B12","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90056-N"},{"key":"B13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580897"},{"key":"B14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580898"},{"key":"B15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04295-9"},{"key":"B16","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176995765"},{"key":"B17","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(13)80064-9"},{"key":"B18","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1965.11970533"},{"key":"B19","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00116-X"},{"key":"B20","doi-asserted-by":"publisher","DOI":"10.2307\/1427607"},{"issue":"2","key":"B21","first-page":"135","volume":"3","author":"Jaumard B","year":"1991","journal-title":"J. Comput."},{"key":"B22","doi-asserted-by":"publisher","DOI":"10.1007\/BF01531078"},{"key":"B23","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00246-0"},{"key":"B24","doi-asserted-by":"publisher","DOI":"10.2307\/1426084"},{"key":"B25","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1975.10479893"},{"key":"B26","doi-asserted-by":"publisher","DOI":"10.1287\/opre.36.1.145"},{"key":"B27","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2004.03.003"},{"key":"B28","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.05.023"},{"key":"B29","doi-asserted-by":"publisher","DOI":"10.2307\/3213226"},{"key":"B30","doi-asserted-by":"publisher","DOI":"10.1137\/15M100866X"},{"key":"B31","doi-asserted-by":"publisher","DOI":"10.1016\/j.spl.2016.04.017"},{"key":"B32","unstructured":"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."},{"key":"B33","doi-asserted-by":"publisher","DOI":"10.1080\/03610918.2018.1468459"}],"container-title":["Mathematics of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/pubsonline.informs.org\/doi\/pdf\/10.1287\/moor.2023.0019","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T09:40:43Z","timestamp":1772876443000},"score":1,"resource":{"primary":{"URL":"https:\/\/pubsonline.informs.org\/doi\/10.1287\/moor.2023.0019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["10.1287\/moor.2023.0019"],"URL":"https:\/\/doi.org\/10.1287\/moor.2023.0019","relation":{},"ISSN":["0364-765X","1526-5471"],"issn-type":[{"value":"0364-765X","type":"print"},{"value":"1526-5471","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1]]}}}