论文信息 - Exchange and Interchange Procedures to Search for Optimal Designs

Exchange and Interchange Procedures to Search for Optimal Designs

SUMMARY An algorithm to search for optimal block designs is described. This algorithm consists of an exchange procedure and an interchange procedure. During the exchange procedure the "correct" treatment replications are determined and during the interchange procedure an optimal set of treatment concurrences is searched for. The optimality criterion is the sum of the weighted variances of a set of treatment contrasts of interest. Examples which illustrate how the algorithm can be used to obtain designs which have a variance structure that reflects the interest expressed in a set of treatment contrasts are given and the performance of the algorithm is discussed.

Byron Jones | J. A. Eccleston | J. Eccleston | B. Jones

[1] S. Pearce. The Use and Classification of Non-Orthogonal Designs , 1963 .

[2] W. H. Clatworthy,et al. Tables of two-associate-class partially balanced designs , 1975 .

[3] J. Eccleston,et al. Recursive techniques for the construction of experimental designs , 1980 .

[4] Byron Jones,et al. Algorithms to Search for Optimal Row-and-column Designs , 1979 .

[5] J. A. John,et al. Optimal Incomplete Block Designs , 1977 .

[6] G. H. Freeman. On the Selection of Designs for Comparative Experiments , 1976 .

[7] Byron Jones,et al. An Algorithm for Deriving Optimal Block Designs , 1976 .