OPTIMAL BLOCK-DESIGNS WITH MINIMAL NUMBER OF OBSERVATIONS

被引：8
|
作者：
BAPAT, RB [1 ]
DEY, A [1 ]
机构：
[1] INDIAN STAT INST,DELHI CTR,NEW DELHI 110016,INDIA
来源：
STATISTICS & PROBABILITY LETTERS | 1991年 / 11卷 / 05期
关键词：
D-OPTIMALITY; E-OPTIMALITY; BINARY DESIGNS; COMPLEXITY OF A GRAPH; SPANNING TREE;
D O I：
10.1016/0167-7152(91)90188-W
中图分类号：
O21 [概率论与数理统计]; C8 [统计学];
学科分类号：
020208 ; 070103 ; 0714 ;
摘要：
Optimal block designs as per the D- and the E-criteria are identified in the class of connected block designs, when the number of experimental units is minimal. It is shown that all designs in the class of competing designs are equivalent with respect to the D-criterion. E-optimal designs are identified.
引用
收藏
页码：399 / 402
页数：4
相关论文
共 50 条
12345