摘要翻译：
从最优性的角度研究了每个重复具有两个块的可分辨设计。因为在实践中，复制的数量通常小于处理的数量，所以参数可以基于信息矩阵的对偶，从而以块并发的形式给出。对于给定的块大小，均衡块并发通常是最好的策略，但并不总是。给出了各种强最优性的充分条件，并给出了E-最优性的详细研究，包括E-最优类的刻画。最优设计被发现对应于平衡阵列和仿射推广。
---
英文标题：
《Resolvable designs with large blocks》
---
作者：
J. P. Morgan, Brian H. Reck
---
最新提交年份：
2007
---
分类信息：

一级分类：Mathematics        数学
二级分类：Statistics Theory        统计理论
分类描述：Applied, computational and theoretical statistics: e.g. statistical inference, regression, time series, multivariate analysis, data analysis, Markov chain Monte Carlo, design of experiments, case studies
应用统计、计算统计和理论统计：例如统计推断、回归、时间序列、多元分析、数据分析、马尔可夫链蒙特卡罗、实验设计、案例研究
--
一级分类：Statistics        统计学
二级分类：Statistics Theory        统计理论
分类描述：stat.TH is an alias for math.ST. Asymptotics, Bayesian Inference, Decision Theory, Estimation, Foundations, Inference, Testing.
Stat.Th是Math.St的别名。渐近，贝叶斯推论，决策理论，估计，基础，推论，检验。
--

---
英文摘要：
  Resolvable designs with two blocks per replicate are studied from an optimality perspective. Because in practice the number of replicates is typically less than the number of treatments, arguments can be based on the dual of the information matrix and consequently given in terms of block concurrences. Equalizing block concurrences for given block sizes is often, but not always, the best strategy. Sufficient conditions are established for various strong optimalities and a detailed study of E-optimality is offered, including a characterization of the E-optimal class. Optimal designs are found to correspond to balanced arrays and an affine-like generalization.
---
PDF链接：
https://arxiv.org/pdf/708.1896