Article ID Journal Published Year Pages File Type
1150216 Journal of Statistical Planning and Inference 2007 14 Pages PDF
Abstract
The A-optimality problem is solved for three treatments in a row-column layout. Depending on the numbers of rows and columns, the requirements for optimality can be decidedly counterintuitive: replication numbers need not be as equal as possible, and trace of the information matrix need not be maximal. General rules for comparing 3×3 information matrices for their A-behavior are also developed, and the A-optimality problem is also solved for three treatments in simple block designs.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Applied Mathematics
Authors
, ,