Upper bounds of degree 3 for the probability of the union of events via linear programming

We consider the problem of generating upper bounds for the probability of the union of events when the individual probabilities of the events as well as the probabilities of pairs and triples of these events are known. By formulating the problem as a Linear Program, we can obtain bounds as objective function values corresponding to dual basic solutions. The upper bounds are based on underlying graph structures.