Conditions for universal optimality of block designs
本文推广了Kiefer(1975)提出的普遍最优性充分条件，使其适用于信息矩阵无法达到完全对称的情形，并应用于二元区组设计的最优性证明。
Kiefer (1975) introduced the criterion of universal optimality and provided a sufficient condition for a design being universally optimal. The condition requires maximum trace and complete symmetry from the information matrix of a design. In many instances, this condition cannot be achieved. In this paper, Kiefer's condition is generalized and applications are found in the justification of universal optimality over the class of binary block designs.