|
Activity Number:
|
140
|
|
Type:
|
Contributed
|
|
Date/Time:
|
Monday, August 4, 2008 : 10:30 AM to 12:20 PM
|
|
Sponsor:
|
Section on Physical and Engineering Sciences
|
| Abstract - #301624 |
|
Title:
|
Whole-Plot Exchange Algorithms for Constructing D-Optimal Multistratum Designs
|
|
Author(s):
|
Christopher I. Vahl*+ and George A. Milliken
|
|
Companies:
|
North Dakota State University and Kansas State University
|
|
Address:
|
P.O. Box 5575, Waldron 201, Dept. of Statistics, Fargo, ND, 58105,
|
|
Keywords:
|
multistratum design ; optimal design ; split-plot ; exchange algorithm
|
|
Abstract:
|
Multistratum experiments contain several different sizes of experimental units. Examples include split-plot and strip-plot designs as well as randomized block designs. Here we propose to a strategy for constructing a D-optimal multistratum design by improving a randomly generated starting design through a sequence of whole-plot exchanges. This approach preserves the design structure and simplifies updates to the information matrix. Moreover, it is applicable to any multistratum design where the largest-sized experimental unit is either a whole plot or a block. Three whole-plot exchange algorithms will be described and the results of the application of these algorithms to several design problems will be discussed.
|
