A systematic construction of compromise designs under baseline parameterization

Karunanayaka and Tang (2017) introduced a class of compromise designs for estimating main effects under the baseline parameterization. Their approach is to add some runs to the basic one-factor-at-a-time design, and its implementation requires computer search except for the case of adding one run where a theoretical result is available. The reliance on computer search only allowed them to find the limited results from adding up to four runs to the basic one-factor-at-a-time design. In this paper, we provide a systematic construction of compromise designs, without computer search and without restriction on the run size and the number of factors. Closed-form expressions of the bias and efficiency criteria are obtained for the new designs. Both theoretical and empirical studies show that our designs outperform those of Karunanayaka and Tang (2017) saving small-sized problems.