Article ID Journal Published Year Pages File Type
5128480 Operations Research Letters 2017 6 Pages PDF
Abstract

As recently studied in Lee and Prékopa (2017), in the general case of Rn,n≥3, if certain conditions among the projected sets are met, the probability of union of such sets can be efficiently calculated by the modified inclusion-exclusion formula in a recursive manner. In this paper, we study with the fullest generality how to construct such suitable conditions on the partial order relation. Upon this basis we can use the modified inclusion-exclusion formulas in any case. Numerical examples are presented.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
,