Let
for the one-sided cases, or
for the two-sided cases.
We let
where
is the compliment of the set
.
The Bonferroni bound for
(see Hsu, 1996) is
A simple upper bound for
is
Both of these bounds require only 1-dimensional distribution values.
If
and
are determined by solving
and
, respectively, then
.
This bounding interval for
can be found directly using the
appropriate 1-dimensional inverse distribution function.
For example, with the two-sided case,
where
.
Shorter intervals can be found using bivariate distribution
values (Dunnett and Sobel, 1954) if a modified Bonferroni bound
(Dawson and Sankoff, 1967) is combined with the Hunter-Worsley
bound. These bounds are described in the book by Hsu (1966, Appendix A).
If we define
by
then the modified Bonferroni bounds and Hunter-Worsley guarantee that
where
and
is maximal spanning
tree for complete graph of order
with edge weights
.
If
and
then
.
Starting with
, we can use numerical optimization, applied to
, to determine
, then use numerical optimization, applied to
starting with
, to determine
.
2003-02-17