CONSTRUCTION OF OPTIMAL BLOCK-DESIGNS BY COMPUTE

被引：24
作者：
NGUYEN, NK
机构：
来源：
TECHNOMETRICS | 1994年 / 36卷 / 03期
关键词：
D O I：
10.2307/1269374
中图分类号：
O21 [概率论与数理统计]; C8 [统计学];
学科分类号：
020208 ; 070103 ; 0714 ;
摘要：
This article describes an effective algorithm for constructing optimal or near-optimal incomplete block designs with up to 100 treatments. The algorithm is found to perform well when evaluated against 874 optimal or near-optimal incomplete block designs in the literature. Examples that motivated the development of the algorithm are given.
引用
收藏
页码：300 / 307
页数：8
相关论文
共 35 条
[1]  
CLATWORTHY WH, 1973, APPLIED MATH SER, V63
[2]   COMMENTS ON COOK AND NACHTSHEIM (1989) - RESPONSE [J].
COOK, RD .
TECHNOMETRICS, 1990, 32 (03) :364-365
[3]   THEORY OF CONNECTED DESIGNS - CHARACTERIZATION AND OPTIMALITY [J].
ECCLESTON, JA ;
HEDAYAT, A .
ANNALS OF STATISTICS, 1974, 2 (06) :1238-1255
[4]  
FEDERER WT, 1990, J ROYAL STATISTICA A, V153, P187
[5]  
FISHER RA, 1963, STATISTICAL TABLES B
[6]   NONRESOLVABLE INCOMPLETE BLOCK-DESIGNS WITH FEW REPLICATES [J].
HALL, WB ;
JARRETT, RG .
BIOMETRIKA, 1981, 68 (03) :617-627
[7]  
Jarrett R.G., 1989, AUSTR J STATIST, V31, P118
[8]  
John J.A., 1987, CYCLIC DESIGNS
[9]  
JOHN JA, 1977, J ROY STAT SOC B MET, V39, P39
[10]  
JOHN JA, 1972, APPLIED MATH SER, V62
1234