COLUMNWISE-PAIRWISE ALGORITHMS WITH APPLICATIONS TO THE CONSTRUCTION OF SUPERSATURATED DESIGNS

Motivated by the construction of supersaturated designs, we develop a class of algorithms called columnwise-pairwise exchange algorithms. Th ey differ from the Ic-exchange algorithms in two respects: (1) They ex change columns instead of rows of the design matrix, and (2) they empl oy a pairwise adjustment in the search for a ''better'' column. The pr oposed algorithms perform very well in the construction of supersatura ted designs both for a single criterion and for multiple criteria. The y are also applicable to the construction of designs that are not supe rsaturated.