Abstract
We introduce and discuss a new algorithm to convert a given binary block design, if possible, into a linear trend-free block design. The only permissible operation in attempting this conversion is that of reallocating treatments to plots within blocks; the treatment-block incidence structure is not allowed to be changed. We discuss an extension of the algorithm to cases where the trend is thought to be of a higher degree, and establish a relation between the algorithm and the optimal assignment problem, a well-known problem in operations research.
Original language | English (US) |
---|---|
Pages (from-to) | 57-70 |
Number of pages | 14 |
Journal | Journal of Statistical Planning and Inference |
Volume | 78 |
Issue number | 1-2 |
DOIs | |
State | Published - May 1999 |
Keywords
- Optimal assignment problem
- Search algorithm
- Time or spatial trends
- Trend-free designs
ASJC Scopus subject areas
- Statistics and Probability
- Statistics, Probability and Uncertainty
- Applied Mathematics