A candidate-set-free algorithm for generating D-optimal split-plot designs

69Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We introduce a new method for generating optimal split-plot designs. These designs are optimal in the sense that they are efficient for estimating the fixed effects of the statistical model that is appropriate given the split-plot design structure. One advantage of the method is that it does not require the prior specification of a candidate set. This makes the production of split-plot designs computationally feasible in situations where the candidate set is too large to be tractable. The method allows for flexible choice of the sample size and supports inclusion of both continuous and categorical factors. The model can be any linear regression model and may include arbitrary polynomial terms in the continuous factors and interaction terms of any order. We demonstrate the usefulness of this flexibility with a 100-run polypropylene experiment involving 11 factors where we found a design that is substantially more efficient than designs that are produced by using other approaches. © 2007 Royal Statistical Society.

Cite

CITATION STYLE

APA

Jones, B., & Goos, P. (2007). A candidate-set-free algorithm for generating D-optimal split-plot designs. Journal of the Royal Statistical Society. Series C: Applied Statistics, 56(3), 347–364. https://doi.org/10.1111/j.1467-9876.2007.00581.x

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free