Branch-and-Bound Search for Experimental Designs Based on D Optimality and Other Criteria
Branch-and-Bound Search for Experimental Designs Based on D Optimality and Other Criteria
复制标题
DOI：
10.1080/00401706.1982.10487707
复制
发表时间：
1982-02
期刊：
影响因子：
2.5
通讯作者：
W. Welch
中科院分区：
文献类型：
--
作者：
W. Welch
本文提出了一种分支定界算法，该算法对指定的设计区域、线性模型和观测数n构建了所有D-最优n点设计的目录。虽然主要设计准则是D最优性，但该算法也可以是D最优性。用于发现在其他次要标准下表现良好的设计，如果接受由D最优性测量的敏捷性的小牺牲。最后，给出了二次响应面模型的一些设计。
This article presents a branch-and-bound algorithm that constructs a catalog of all D-optimal n-point designs for specified design region, linear model, and number of observations, n. While the primary design criterion is D optimality, the algorithm may also be. used to find designs performing well by other secondary criteria, if a small sacrifice in ellkiency as measured by D optimahty is accepted. Finally, some designs are supplied for a quadratic response surface model.