A note on the Kounias and Marin Method of Best Linear Bonferroni Bounds

Upper and lower probability bounds of degree two for the union (or intersection) of a sequence of n events are derived using a linear programming algorithm. The approach is compared to that suggested by Kounias and Mann and is shown to be the dual of their linear programming formulation. The new approach is simpler and more efficient.