Design catalog based on minimum G-aberration


Deng and Tang (Technometrics 44 (2002) 173) constructed a catalog of designs of 16, 20 and 24 runs using the criterion of minimum G-aberration, by searching through all orthogonal arrays from Hadamard matrices. Since it is not true that every orthogonal array can be embedded into a Hadamard matrix, some good designs may be missing from their catalog. This paper examines the same problem by considering all orthogonal arrays. Two advantages result from removing the restriction to designs from Hadamard matrices. We are able to obtain some results on designs of run size 28 or higher. More importantly, we have indeed found minimum G-aberration designs that cannot be embedded into Hadamard matrices. A catalog of useful designs is presented here and its usefulness discussed. © 2003 Elsevier B.V. All rights reserved.

Publication Title

Journal of Statistical Planning and Inference