Construction of optimal supersaturated designs by the packing method

A supersaturated design is essentially a factorial design with the equal occurrence of levels property and no fully aliased factors in which the number of main effects is greater than the number of runs. It has received much recent interest because of its potential in factor screening experiments. A packing design is an important object in combinatorial design theory. In this paper, a strong link between the two apparently unrelated kinds of designs is shown. Several criteria for comparing supersaturated designs are proposed, their properties and connections with other existing criteria are discussed. A combinatorial approach, called the packing method, for constructing optimal supersaturated designs is presented, and properties of the resulting designs are also investigated. Comparisons between the new designs and other existing designs are given, which show that our construction method and the newly constructed designs have good properties.

[1]  Lih-Yuan Deng,et al.  A RESOLUTION RANK CRITERION FOR SUPERSATURATED DESIGNS , 1999 .

[2]  Dennis K. J. Lin,et al.  Three-level supersaturated designs , 1999 .

[3]  Gennian Ge.  Resolvable group divisible designs with block size four , 2002, Discret. Math..

[4]  Douglas R. Stinson,et al.  Frames with Block Size Four , 1992, Canadian Journal of Mathematics.

[5]  Y. Ikebe,et al.  Construction of three-level supersaturated design , 1999 .

[6]  Dennis K. J. Lin,et al.  A new class of supersaturated designs , 1993 .

[7]  Changbao Wu,et al.  Construction of supersaturated designs through partially aliased interactions , 1993 .

[8]  Douglas R. Stinson,et al.  A survey of Kirkman triple systems and related designs , 1991, Discret. Math..

[9]  R. H. F. Denniston,et al.  Sylvester's problem of the 15 schoolgirls , 1974, Discret. Math..

[10]  Dennis K. J. Lin,et al.  On the construction of multi-level supersaturated designs , 2000 .

[11]  S. Yamada,et al.  Supersaturated design including an orthogonal base , 1997 .

[12]  Dennis K. J. Lin,et al.  Optimal mixed-level supersaturated design , 2003 .

[13]  Xuan Lu,et al.  A new method in the construction of two-level supersaturated designs , 2000 .

[14]  Min-Qian Liu,et al.  Construction of E(s2) optimal supersaturated designs using cyclic BIBDs , 2000 .

[15]  Boxin Tang,et al.  A method for constructing supersaturated designs and its Es2 optimality , 1997 .

[16]  Nam-Ky Nguyen.  An algorithmic approach to constructing supersaturated designs , 1996 .

[17]  Kai-Tai Fang,et al.  A new approach in constructing orthogonal and nearly orthogonal arrays , 2000 .

[18]  K. H. Booth,et al.  Some Systematic Supersaturated Designs , 1962 .

[19]  Lih-Yuan Deng,et al.  Orthogonal Arrays: Theory and Applications , 1999, Technometrics.

[20]  Dennis K. J. Lin.  Generating Systematic Supersaturated Designs , 1995 .

[21]  Ching-Shui Cheng,et al.  E(s 2 )-OPTIMAL SUPERSATURATED DESIGNS , 1997 .

[22]  Gennian Ge,et al.  Some new large sets of KTS(v) , 1999, Ars Comb..

[23]  R. H. F. Denniston.  Further Cases of Double Resolvability , 1979, J. Comb. Theory, Ser. A.

[24]  F. E. Satterthwaite.  Random Balance Experimentation , 1959 .

[25]  William Li,et al.  Columnwise-pairwise algorithms with applications to the construction of supersaturated designs , 1997 .