Academic Journal

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

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Boole's Probability Bounding Problem, Linear Programming Aggregations, and Nonnegative Quadratic Pseudo-Boolean Functions.
Συγγραφείς: Boros, Endre1 (AUTHOR) endre.boros@rutgers.edu, Lee, Joonhee2 (AUTHOR) jlee15@pace.edu
Πηγή: Mathematics of Operations Research (INFORMS). Feb2026, Vol. 51 Issue 1, p134-148. 15p.
Θεματικοί όροι: *Linear programming, *Probability theory, *Mathematical programming, Boolean functions, Optimization algorithms, Polyhedral combinatorics
Περίληψη: Hailperin (1965) introduced a linear programming formulation to a difficult family of problems, originally proposed by Boole (1854, 1868). Hailperin's model is computationally still difficult and involves an exponential number of variables (in terms of a typical input size for Boole's problem). Numerous papers provided efficiently computable bounds for the minimum and maximum values of Hailperin's 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's 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. [ABSTRACT FROM AUTHOR]
Copyright of Mathematics of Operations Research (INFORMS) is the property of INFORMS: Institute for Operations Research & the Management Sciences and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Βάση Δεδομένων: Business Source Index
Περιγραφή
ISSN:0364765X
DOI:10.1287/moor.2023.0019