New E(s2)-optimal supersaturated designs constructed from incomplete block designs

We present a method for constructing two-level supersaturated designs (SSDs) from incomplete block designs. A lower bound of E(s(2)) that also covers the case of odd run sizes is given. This bound is attained by SSDs constructed from balanced incomplete block designs. We study SSDs that can be constructed from regular graph designs when balanced incomplete block designs do not exist. A computer search is conducted to find SSDs with 5 <= n <= 50 and n <= m <= 2n that can be constructed from regular graph designs, where m is the number of factors and n is the run size. Many SSDs derived from regular graph designs are optimal. The best E(s(2))-optimal SSDs with respect to additional optimality criteria are tabulated. Some notes on the construction of saturated designs also are given.