On the probability of Boolean functions of events in the n-dimensional Euclidean space

It is shown by the author in 2017 that for the union of N orthants in the n-dimensional space there exists an efficient and systematic way to find the exact value, using a suitable partial order relation construction. In this paper our events are hyperrectangles (or n-orthotopes), the Cartesian product of intervals: another important sets (or events) in both theory and practice. We have discovered a new efficient algorithm for the union of such events. With other important Boolean functions we present optimization problem formulations for both hyperreectangles and orthants.