D-optimal design of split-split-plot experiments
In industrial experimentation, there is growing interest in studies that span more than one processing step. Convenience often dictates restrictions in randomization in passing from one processing step to another. When the study encompasses three processing steps, this leads to split-split-plot designs. We provide an algorithm for computing D-optimal split-split-plot designs and several illustrative examples. Copyright 2009, Oxford University Press.
Year of publication: |
2009
|
---|---|
Authors: | Jones, Bradley ; Goos, Peter |
Published in: |
Biometrika. - Biometrika Trust, ISSN 0006-3444. - Vol. 96.2009, 1, p. 67-82
|
Publisher: |
Biometrika Trust |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Bayesian optimal designs for discrete choice experiments with partial profiles
Kessels, Roselinde, (2011)
-
A candidate-set-free algorithm for generating D-optimal split-plot designs
Jones, Bradley, (2006)
-
An efficient algorithm for constructing Bayesian optimal choice designs
Kessels, Roselinde, (2009)
- More ...