Construction of optimal supersaturated designs by the packing method

作     者：FANG Kaitai GE Gennian LIU Minqian 

作者机构：Department of Mathematics Hong Kong Baptist University Hong Kong China Department of Mathematics Zhejiang University Hangzhou 310027 China Department of Statistics Nankai University Tianjin 300071 China 

出 版 物：《Science China Mathematics》 (中国科学：数学（英文版）)

年 卷 期：2004年第47卷第1期

页      面：128-143页

核心收录：

学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学] 

基　　金：YNSFC, (10001026) Hong Kong Baptist University, HKBU, (FRG/00-01/II-25) National Natural Science Foundation of China, NSFC, (10171051) 

主　　题：Kirkman triple systems, orthogonality, packing design, resolvability, supersaturated design. 

摘      要：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.