Branch-and-Bound Search for Experimental Designs Based onDOptimality and Other Criteria
- 1 February 1982
- journal article
- research article
- Published by Taylor & Francis in Technometrics
- Vol. 24 (1) , 41-48
- https://doi.org/10.1080/00401706.1982.10487707
Abstract
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.Keywords
This publication has 10 references indexed in Scilit:
- A Comparison of Algorithms for Constructing Exact D-Optimal DesignsTechnometrics, 1980
- Time- and Space-Saving Computer Methods, Related to Mitchell's DETMAX, for Finding D-Optimum DesignsTechnometrics, 1980
- D-Optimal Fractions of Three-Level Factorial DesignsTechnometrics, 1978
- Factorial Designs, the |X′X| Criterion, and Some Related MattersTechnometrics, 1971
- On the Selection of Multi-Factor Experimental Arrangements with Resource ConstraintsJournal of the American Statistical Association, 1971
- The Sequential Generation of $D$-Optimum Experimental DesignsThe Annals of Mathematical Statistics, 1970
- An Algorithm for the Traveling Salesman ProblemOperations Research, 1963
- Optimum Designs in Regression ProblemsThe Annals of Mathematical Statistics, 1959
- On the Nonrandomized Optimality and Randomized Nonoptimality of Symmetrical DesignsThe Annals of Mathematical Statistics, 1958
- On the Efficient Design of Statistical InvestigationsThe Annals of Mathematical Statistics, 1943