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

DOI10.1016/0378-3758(95)00117-4zbMath0846.62055OpenAlexW2017136842MaRDI QIDQ1918234

K. Balasubramanian, Aloke Dey

Publication date: 5 September 1996

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0378-3758(95)00117-4

zbMATH Keywords

bipartite graphspanning tree\(D\)-optimalityconnected block designsfixed block sizeminimally connected row-column designs

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Applications of graph theory (05C90) Statistical block designs (62K10)

Related Items (5)

A graphical construction of the D-optimal saturated, \(3\times s^{2}\) main effect, factorial design ⋮ Row-column designs with minimal units ⋮ Optimal incomplete-block designs with low replication: a unified approach using graphs ⋮ Maximal determinant over a certain class of matrices and its application to D-optimality of designs ⋮ Minimal augmented square designs and their extensions

Cites Work

• Unnamed Item
• Optimal block designs with minimal number of observations
• Optimal a\(\times b\) connected designs with \(a+b\) observations
• Almost saturated D-optimal main effect plans and allied results
• D-optimal block designs with at most six varieties
• On the choice of optimality criteria in comparing statistical designs
• D–optimality of a class of saturated main–effect plans and allied results
• Uncertain Resources and Optimal Designs : Problems and Perspectives

This page was built for publication: D-optimal designs with minimal and nearly minimal number of units