\magnification=1200
\hsize=4in
\overfullrule=0pt
\input amssym
%\def\frac#1 #2 {{#1\over #2}}
\def\emph#1{{\it #1}}
\def\em{\it}
\nopagenumbers
\noindent
%
%
{\bf Pierangela Veneziani}
%
%
\medskip
\noindent
%
%
{\bf Graph-Based Upper Bounds for the Probability of the Union of Events}
%
%
\vskip 5mm
\noindent
%
%
%
%
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 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 feasible
solutions.  The new upper bounds are based on underlying bipartite and
threshold type graph structures.



\bye

.
