Computer-generated construction of efficient two level supersaturated designs

Abstract

The co-ordinate column-wise exchange algorithms of Nguyen (1996) and Lejeune (2003) have been modified to generate efficient supersaturated designs (SSDs) for two-level factorial experiments. Designs have been generated for two different settings viz. (a) the design is balanced in the sense that for an n run design, the +1 and -1 levels appear n/2 times each for all the factors; (b) the design is balanced and there is a subset of factors that are mutually orthogonal. The upper bound on the number of active factors that are estimable through the design has also been obtained by computing the rank of design matrix X using the necessary condition of Srivastava (1975). Catalogues of efficient SSDs have been prepared for number of runs 10<=n<=20, n=2t in (a) and n=4t in (b) ,t a positive integer, and number of factors n+2<=m<=2n. A comparison of the designs generated has been made with the designs available in the literature.