Optimal block designs with minimal number of observations

DOI10.1016/0167-7152(91)90188-WzbMath0724.62073OpenAlexW2062245784MaRDI QIDQ758061

Aloke Dey, Ravindra B. Bapat

Publication date: 1991

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-7152(91)90188-w

zbMATH Keywords

D-optimalityspanning treebinary designscomplexity of a graphconnected block designsE-optimal designs

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Statistical block designs (62K10)

Related Items (9)

Graph-theoretic design and analysis of key predistribution schemes ⋮ D-optimal designs with minimal and nearly minimal number of units ⋮ A-optimal connected block designs with nearly minimal number of observations ⋮ Optimal saturated block designs when observations are correlated ⋮ A graphical construction of the D-optimal saturated, \(3\times s^{2}\) main effect, factorial design ⋮ \(E\)-optimal minimally connected block designs under mixed effects model ⋮ Optimal incomplete-block designs with low replication: a unified approach using graphs ⋮ On \(s\)- and (\(m,s\))-optimality of minimal incomplete block designs ⋮ Graph-theoretic techniques in D-optimal design problems

Cites Work

• D-optimal block designs with at most six varieties
• On the choice of optimality criteria in comparing statistical designs
• Matrix Analysis

This page was built for publication: Optimal block designs with minimal number of observations