D-optimal designs with minimal and nearly minimal number of units

被引：4

作者：

Balasubramanian, K ^{[1
]}

Dey, A ^{[1
]}

机构：

[1] INDIAN STAT INST,NEW DELHI 110016,INDIA

来源：

JOURNAL OF STATISTICAL PLANNING AND INFERENCE | 1996年 / 52卷 / 02期

关键词：

D-optimality; bipartite graph; spanning tree; block designs; row-column designs;

D O I：

10.1016/0378-3758(95)00117-4

中图分类号：

O21 [概率论与数理统计]; C8 [统计学];

学科分类号：

020208 ; 070103 ; 0714 ;

摘要：

D-optimal designs are identified in classes of connected block designs with fixed block size when the number of experimental units is one or two more than the minimal number required for the design to be connected. An application of one of these results is made to identify D-optimal designs in a class of minimally connected row-column designs. Graph-theoretic methods are employed to arrive at the optimality results.

引用

页码：255 / 262

页数：8

共 9 条

[1] OPTIMAL BLOCK-DESIGNS WITH MINIMAL NUMBER OF OBSERVATIONS
BAPAT, RB
DEY, A
[J]. STATISTICS & PROBABILITY LETTERS, 1991, 11 (05) : 399 - 402
[2] OPTIMAL A X B CONNECTED DESIGNS WITH A + B OBSERVATIONS
BIRKES, D
DODGE, Y
[J]. JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 1991, 28 (01) : 49 - 59
[3] Chatterjee K., 1993, J COMBIN INFORM SYST, V18, P116
[4] D-OPTIMAL BLOCK-DESIGNS WITH AT MOST 6 VARIETIES
GAFFKE, N
[J]. JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 1982, 6 (02) : 183 - 200
[5] KRAFFT O, 1990, PROBABILITY STAT DES, P461
[6] Mandal N. K., 1990, CALCUTTA STAT ASS B, V40, P267
[7] Mukerjee R., 1990, METRIKA, V37, P301
[8] Mukerjee R., 1986, STATISTICS, V17, P349
[9] SHAH KR, 1989, LECTURE NOTES STAT, V54

← 1 →