An algorithm for arranging response surface designs in small blocks
We consider the problem of blocking response surface designs when the block sizes are prespecified to control variation efficiently and the treatment set is chosen independently of the block structure. We show how the loss of information due to blocking is related to scores defined by Mead and prese...
Saved in:
Published in: | Computational statistics & data analysis Vol. 33; no. 1; pp. 25 - 43 |
---|---|
Main Authors: | , |
Format: | Journal Article |
Language: | English |
Published: |
Amsterdam
Elsevier B.V
28-03-2000
Elsevier Science Elsevier |
Series: | Computational Statistics & Data Analysis |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | We consider the problem of blocking response surface designs when the block sizes are prespecified to control variation efficiently and the treatment set is chosen independently of the block structure. We show how the loss of information due to blocking is related to scores defined by Mead and present an interchange algorithm based on scores to improve a given blocked design. Examples illustrating the performance of the algorithm are given and some comparisons with other designs are made. |
---|---|
ISSN: | 0167-9473 1872-7352 |
DOI: | 10.1016/S0167-9473(99)00033-X |