Whole-Plot Exchange Algorithms for Constructing D-Optimal Multistratum Designs

摘要

Multistratum experiments contain several different sizes of experimental units. Examples include split-plot, strip-plot designs, and randomized block designs. We propose a strategy for constructing a D-optimal multistratum design by improving a randomly generated design through a sequence of whole-plot exchanges. This approach preserves the design structure and simplifies updates to the information and is applicable to any multistratum design where the largest-sized experimental unit is either a whole plot or a block. Two whole-plot exchange algorithms inspired by the point-exchange strategies of Fedorov (1972) and Wynn (1972) are described. The application of the algorithms to several design problems is discussed.