Resolvable designs with large blocks

Abstract

Resolvable designs with two blocks per replicate are studied from an optimality perspective. Because in practice the number of replicates is typically less than the number of treatments, arguments can be based on the dual of the information matrix and consequently given in terms of block concurrences. Equalizing block concurrences for given block sizes is often, but not always, the best strategy. Sufficient conditions are established for various strong optimalities and a detailed study of E-optimality is offered, including a characterization of the E-optimal class. Optimal designs are found to correspond to balanced arrays and an affine-like generalization.