In the design of experiments, **optimal designs** (or **optimum designs**^{[2]}) are a class of experimental designs that are optimal with respect to some statistical criterion. The creation of this field of statistics has been credited to Danish statistician Kirstine Smith.^{[3]}^{[4]}

In the design of experiments for estimating statistical models, **optimal designs** allow parameters to be estimated without bias and with minimum variance. A non-optimal design requires a greater number of experimental runs to estimate the parameters with the same precision as an optimal design. In practical terms, optimal experiments can reduce the costs of experimentation.

The optimality of a design depends on the statistical model and is assessed with respect to a statistical criterion, which is related to the variance-matrix of the estimator. Specifying an appropriate model and specifying a suitable criterion function both require understanding of statistical theory and practical knowledge with designing experiments.

## Advantages

Optimal designs offer three advantages over sub-optimal experimental designs:^{[5]}

- Optimal designs reduce the costs of experimentation by allowing statistical models to be estimated with fewer experimental runs.
- Optimal designs can accommodate multiple types of factors, such as process, mixture, and discrete factors.
- Designs can be optimized when the design-space is constrained, for example, when the mathematical process-space contains factor-settings that are practically infeasible (e.g. due to safety concerns).

## Minimizing the variance of estimators

Experimental designs are evaluated using statistical criteria.^{[6]}

It is known that the least squares estimator minimizes the variance of mean-unbiased estimators (under the conditions of the Gauss–Markov theorem). In the estimation theory for statistical models with one real parameter, the reciprocal of the variance of an ("efficient") estimator is called the "Fisher information" for that estimator.^{[7]} Because of this reciprocity, ** minimizing the variance** corresponds to

**.**

*maximizing*the*information*When the statistical model has several parameters, however, the mean of the parameter-estimator is a vector and its variance is a matrix. The inverse matrix of the variance-matrix is called the "information matrix". Because the variance of the estimator of a parameter vector is a matrix, the problem of "minimizing the variance" is complicated. Using statistical theory, statisticians compress the information-matrix using real-valued summary statistics; being real-valued functions, these "information criteria" can be maximized.^{[8]} The traditional optimality-criteria are invariants of the information matrix; algebraically, the traditional optimality-criteria are functionals of the eigenvalues of the information matrix.

**A**-optimality ("**average**" or**trace**)**C**-optimality- This criterion minimizes the variance of a best linear unbiased estimator of a predetermined linear combination of model parameters.

**D**-optimality (**determinant**)- A popular criterion is
**D-optimality**, which seeks to minimize |(X'X)^{−1}|, or equivalently maximize the determinant of the information matrix X'X of the design. This criterion results in maximizing the differential Shannon information content of the parameter estimates.

- A popular criterion is
**E**-optimality (**eigenvalue**)- Another design is
**E-optimality**, which maximizes the minimum eigenvalue of the information matrix.

- Another design is
**T**-optimality- This criterion maximizes the trace of the information matrix.

Other optimality-criteria are concerned with the variance of predictions:

**G**-optimality- A popular criterion is
**G-optimality**, which seeks to minimize the maximum entry in the diagonal of the hat matrix X(X'X)^{−1}X'. This has the effect of minimizing the maximum variance of the predicted values.

- A popular criterion is
**I**-optimality (**integrated**)- A second criterion on prediction variance is
**I-optimality**, which seeks to minimize the average prediction variance*over the design space*.

- A second criterion on prediction variance is
**V**-optimality (**variance**)- A third criterion on prediction variance is
**V-optimality**, which seeks to minimize the average prediction variance over a set of m specific points.^{[9]}

- A third criterion on prediction variance is

### Contrasts

In many applications, the statistician is most concerned with a "parameter of interest" rather than with "nuisance parameters". More generally, statisticians consider linear combinations of parameters, which are estimated via linear combinations of treatment-means in the design of experiments and in the analysis of variance; such linear combinations are called contrasts. Statisticians can use appropriate optimality-criteria for such parameters of interest and for contrasts.^{[10]}

## Implementation

Catalogs of optimal designs occur in books and in software libraries.

In addition, major statistical systems like SAS and R have procedures for optimizing a design according to a user's specification. The experimenter must specify a model for the design and an optimality-criterion before the method can compute an optimal design.^{[11]}

## Practical considerations

Some advanced topics in optimal design require more statistical theory and practical knowledge in designing experiments.

### Model dependence and robustness

Since the optimality criterion of most optimal designs is based on some function of the information matrix, the 'optimality' of a given design is *model dependent*: While an optimal design is best for that model, its performance may deteriorate on other models. On other models, an *optimal* design can be either better or worse than a non-optimal design.^{[12]} Therefore, it is important to benchmark the performance of designs under alternative models.^{[13]}

### Choosing an optimality criterion and robustness

The choice of an appropriate optimality criterion requires some thought, and it is useful to benchmark the performance of designs with respect to several optimality criteria. Cornell writes that

since the [traditional optimality] criteria . . . are variance-minimizing criteria, . . . a design that is optimal for a given model using one of the . . . criteria is usually near-optimal for the same model with respect to the other criteria.

—^{[14]}

Indeed, there are several classes of designs for which all the traditional optimality-criteria agree, according to the theory of "universal optimality" of Kiefer.^{[15]} The experience of practitioners like Cornell and the "universal optimality" theory of Kiefer suggest that robustness with respect to changes in the *optimality-criterion* is much greater than is robustness with respect to changes in the *model*.

#### Flexible optimality criteria and convex analysis

High-quality statistical software provide a combination of libraries of optimal designs or iterative methods for constructing approximately optimal designs, depending on the model specified and the optimality criterion. Users may use a standard optimality-criterion or may program a custom-made criterion.

All of the traditional optimality-criteria are convex (or concave) functions, and therefore optimal-designs are amenable to the mathematical theory of convex analysis and their computation can use specialized methods of convex minimization.^{[16]} The practitioner need not select *exactly one* traditional, optimality-criterion, but can specify a custom criterion. In particular, the practitioner can specify a convex criterion using the maxima of convex optimality-criteria and nonnegative combinations of optimality criteria (since these operations preserve convex functions). For *convex* optimality criteria, the Kiefer-Wolfowitz equivalence theorem allows the practitioner to verify that a given design is globally optimal.^{[17]} The Kiefer-Wolfowitz equivalence theorem is related with the Legendre-Fenchel conjugacy for convex functions.^{[18]}

If an optimality-criterion lacks convexity, then finding a global optimum and verifying its optimality often are difficult.

### Model uncertainty and Bayesian approaches

#### Model selection

When scientists wish to test several theories, then a statistician can design an experiment that allows optimal tests between specified models. Such "discrimination experiments" are especially important in the biostatistics supporting pharmacokinetics and pharmacodynamics, following the work of Cox and Atkinson.^{[19]}

#### Bayesian experimental design

When practitioners need to consider multiple models, they can specify a probability-measure on the models and then select any design maximizing the expected value of such an experiment. Such probability-based optimal-designs are called optimal Bayesian designs. Such Bayesian designs are used especially for generalized linear models (where the response follows an exponential-family distribution).^{[20]}

The use of a Bayesian design does not force statisticians to use Bayesian methods to analyze the data, however. Indeed, the "Bayesian" label for probability-based experimental-designs is disliked by some researchers.^{[21]} Alternative terminology for "Bayesian" optimality includes "on-average" optimality or "population" optimality.

## Iterative experimentation

Scientific experimentation is an iterative process, and statisticians have developed several approaches to the optimal design of sequential experiments.

### Sequential analysis

Sequential analysis was pioneered by Abraham Wald.^{[22]} In 1972, Herman Chernoff wrote an overview of optimal sequential designs,^{[23]} while adaptive designs were surveyed later by S. Zacks.^{[24]} Of course, much work on the optimal design of experiments is related to the theory of optimal decisions, especially the statistical decision theory of Abraham Wald.^{[25]}

### Response-surface methodology

Optimal designs for response-surface models are discussed in the textbook by Atkinson, Donev and Tobias, and in the survey of Gaffke and Heiligers and in the mathematical text of Pukelsheim. The blocking of optimal designs is discussed in the textbook of Atkinson, Donev and Tobias and also in the monograph by Goos.

The earliest optimal designs were developed to estimate the parameters of regression models with continuous variables, for example, by J. D. Gergonne in 1815 (Stigler). In English, two early contributions were made by Charles S. Peirce and Kirstine Smith.

Pioneering designs for multivariate response-surfaces were proposed by George E. P. Box. However, Box's designs have few optimality properties. Indeed, the Box–Behnken design requires excessive experimental runs when the number of variables exceeds three.^{[26]}
Box's "central-composite" designs require more experimental runs than do the optimal designs of Kôno.^{[27]}

### System identification and stochastic approximation

The optimization of sequential experimentation is studied also in stochastic programming and in systems and control. Popular methods include stochastic approximation and other methods of stochastic optimization. Much of this research has been associated with the subdiscipline of system identification.^{[28]}
In computational optimal control, D. Judin & A. Nemirovskii and Boris Polyak has described methods that are more efficient than the (Armijo-style) step-size rules introduced by G. E. P. Box in response-surface methodology.^{[29]}

Adaptive designs are used in clinical trials, and optimal adaptive designs are surveyed in the *Handbook of Experimental Designs* chapter by Shelemyahu Zacks.

## Specifying the number of experimental runs

### Using a computer to find a good design

There are several methods of finding an optimal design, given an *a priori* restriction on the number of experimental runs or replications. Some of these methods are discussed by Atkinson, Donev and Tobias and in the paper by Hardin and Sloane. Of course, fixing the number of experimental runs *a priori* would be impractical. Prudent statisticians examine the other optimal designs, whose number of experimental runs differ.

### Discretizing probability-measure designs

In the mathematical theory on optimal experiments, an optimal design can be a probability measure that is supported on an infinite set of observation-locations. Such optimal probability-measure designs solve a mathematical problem that neglected to specify the cost of observations and experimental runs. Nonetheless, such optimal probability-measure designs can be discretized to furnish approximately optimal designs.^{[30]}

In some cases, a finite set of observation-locations suffices to support an optimal design. Such a result was proved by Kôno and Kiefer in their works on response-surface designs for quadratic models. The Kôno–Kiefer analysis explains why optimal designs for response-surfaces can have discrete supports, which are very similar as do the less efficient designs that have been traditional in response surface methodology.^{[31]}

## History

In 1815, an article on optimal designs for polynomial regression was published by Joseph Diaz Gergonne, according to Stigler.

Charles S. Peirce proposed an economic theory of scientific experimentation in 1876, which sought to maximize the precision of the estimates. Peirce's optimal allocation immediately improved the accuracy of gravitational experiments and was used for decades by Peirce and his colleagues. In his 1882 published lecture at Johns Hopkins University, Peirce introduced experimental design with these words:

Logic will not undertake to inform you what kind of experiments you ought to make in order best to determine the acceleration of gravity, or the value of the Ohm; but it will tell you how to proceed to form a plan of experimentation.

[....] Unfortunately practice generally precedes theory, and it is the usual fate of mankind to get things done in some boggling way first, and find out afterward how they could have been done much more easily and perfectly.^{[32]}

Kirstine Smith proposed optimal designs for polynomial models in 1918. (Kirstine Smith had been a student of the Danish statistician Thorvald N. Thiele and was working with Karl Pearson in London.)

## See also

## Notes

**^**Nordström (1999, p. 176)**^**The adjective "optimum" (and not "optimal") "is the slightly older form in English and avoids the construction 'optim(um) + al´—there is no 'optimalis' in Latin" (page x in*Optimum Experimental Designs, with SAS*, by Atkinson, Donev, and Tobias).**^**Guttorp, P.; Lindgren, G. (2009). "Karl Pearson and the Scandinavian school of statistics".*International Statistical Review*.**77**: 64. CiteSeerX 10.1.1.368.8328. doi:10.1111/j.1751-5823.2009.00069.x.**^**Smith, Kirstine (1918). "On the standard deviations of adjusted and interpolated values of an observed polynomial function and its constants and the guidance they give towards a proper choice of the distribution of observations".*Biometrika*.**12**(1/2): 1–85. doi:10.2307/2331929. JSTOR 2331929.**^**These three advantages (of optimal designs) are documented in the textbook by Atkinson, Donev, and Tobias.**^**Such criteria are called objective functions in optimization theory.**^**The Fisher information and other "information" functionals are fundamental concepts in statistical theory.**^**Traditionally, statisticians have evaluated estimators and designs by considering some summary statistic of the covariance matrix (of a mean-unbiased estimator), usually with positive real values (like the determinant or matrix trace). Working with positive real-numbers brings several advantages: If the estimator of a single parameter has a positive variance, then the variance and the Fisher information are both positive real numbers; hence they are members of the convex cone of nonnegative real numbers (whose nonzero members have reciprocals in this same cone).

For several parameters, the covariance-matrices and information-matrices are elements of the convex cone of nonnegative-definite symmetric matrices in a partially ordered vector space, under the Loewner (Löwner) order. This cone is closed under matrix-matrix addition, under matrix-inversion, and under the multiplication of positive real-numbers and matrices. An exposition of matrix theory and the Loewner-order appears in Pukelsheim.**^**The above optimality-criteria are convex functions on domains of symmetric positive-semidefinite matrices: See an on-line textbook for practitioners, which has many illustrations and statistical applications:- Boyd, Stephen P.; Vandenberghe, Lieven (2004).
*Convex Optimization*(PDF). Cambridge University Press. ISBN 978-0-521-83378-3. Retrieved October 15, 2011. (book in pdf)

- Boyd, Stephen P.; Vandenberghe, Lieven (2004).
**^**Optimality criteria for "parameters of interest" and for contrasts are discussed by Atkinson, Donev and Tobias.**^**Iterative methods and approximation algorithms are surveyed in the textbook by Atkinson, Donev and Tobias and in the monographs of Fedorov (historical) and Pukelsheim, and in the survey article by Gaffke and Heiligers.**^**See Kiefer ("Optimum Designs for Fitting Biased Multiresponse Surfaces" pages 289–299).**^**Such benchmarking is discussed in the textbook by Atkinson et al. and in the papers of Kiefer.*Model-robust*designs (including "Bayesian" designs) are surveyed by Chang and Notz.**^**Cornell, John (2002).*Experiments with Mixtures: Designs, Models, and the Analysis of Mixture Data*(third ed.). Wiley. ISBN 978-0-471-07916-3. (Pages 400-401)**^**An introduction to "universal optimality" appears in the textbook of Atkinson, Donev, and Tobias. More detailed expositions occur in the advanced textbook of Pukelsheim and the papers of Kiefer.**^**Computational methods are discussed by Pukelsheim and by Gaffke and Heiligers.**^**The Kiefer-Wolfowitz equivalence theorem is discussed in Chapter 9 of Atkinson, Donev, and Tobias.**^**Pukelsheim uses convex analysis to study Kiefer-Wolfowitz equivalence theorem in relation to the Legendre-Fenchel conjugacy for convex functions The minimization of convex functions on domains of symmetric positive-semidefinite matrices is explained in an on-line textbook for practitioners, which has many illustrations and statistical applications:*Convex Optimization*. Cambridge University Press. 2004. (book in pdf)

**^**See Chapter 20 in Atkinison, Donev, and Tobias.**^**Bayesian designs are discussed in Chapter 18 of the textbook by Atkinson, Donev, and Tobias. More advanced discussions occur in the monograph by Fedorov and Hackl, and the articles by Chaloner and Verdinelli and by DasGupta. Bayesian designs and other aspects of "model-robust" designs are discussed by Chang and Notz.**^**As an alternative to "*Bayesian*optimality", "*on-average*optimality" is advocated in Fedorov and Hackl.**^**Wald, Abraham (June 1945). "Sequential Tests of Statistical Hypotheses".*The Annals of Mathematical Statistics*.**16**(2): 117–186. doi:10.1214/aoms/1177731118. JSTOR 2235829.**^**Chernoff, H. (1972)*Sequential Analysis and Optimal Design,*SIAM Monograph.**^**Zacks, S. (1996) "Adaptive Designs for Parametric Models". In: Ghosh, S. and Rao, C. R., (Eds) (1996).*Design and Analysis of Experiments,*Handbook of Statistics, Volume 13. North-Holland. ISBN 0-444-82061-2. (pages 151–180)**^**Henry P. Wynn wrote, "the modern theory of optimum design has its roots in the decision theory school of U.S. statistics founded by Abraham Wald" in his introduction "Jack Kiefer's Contributions to Experimental Design", which is pages xvii–xxiv in the following volume:- Kiefer, Jack Carl (1985). Brown, Lawrence D.; Olkin, Ingram; Jerome Sacks; Wynn, Henry P (eds.).
*Jack Carl Kiefer Collected Papers III Design of Experiments*. Springer-Verlag and the Institute of Mathematical Statistics. pp. 718+xxv. ISBN 978-0-387-96004-3.

- Kiefer, J. (1959). "Optimum Experimental Designs".
*Journal of the Royal Statistical Society, Series B*.**21**: 272–319.

- Kiefer, Jack Carl (1985). Brown, Lawrence D.; Olkin, Ingram; Jerome Sacks; Wynn, Henry P (eds.).
**^**In the field of response surface methodology, the inefficiency of the Box–Behnken design is noted by Wu and Hamada (page 422).- Wu, C. F. Jeff & Hamada, Michael (2002).
*Experiments: Planning, Analysis, and Parameter Design Optimization*. Wiley. ISBN 978-0-471-25511-6.

- Wu, C. F. Jeff & Hamada, Michael (2002).
**^**The inefficiency of Box's "central-composite" designs are discussed by according to Atkinson, Donev, and Tobias (page 165). These authors also discuss the blocking of Kôno-type designs for quadratic response-surfaces.**^**In system identification, the following books have chapters on optimal experimental design:- Goodwin, Graham C. & Payne, Robert L. (1977).
*Dynamic System Identification: Experiment Design and Data Analysis*. Academic Press. ISBN 978-0-12-289750-4. - Walter, Éric & Pronzato, Luc (1997).
*Identification of Parametric Models from Experimental Data*. Springer.

- Goodwin, Graham C. & Payne, Robert L. (1977).
**^**Some step-size rules for of Judin & Nemirovskii and of Polyak Archived 2007-10-31 at the Wayback Machine are explained in the textbook by Kushner and Yin:- Kushner, Harold J.; Yin, G. George (2003).
*Stochastic Approximation and Recursive Algorithms and Applications*(Second ed.). Springer. ISBN 978-0-387-00894-3.

- Kushner, Harold J.; Yin, G. George (2003).
**^**The discretization of optimal probability-measure designs to provide approximately optimal designs is discussed by Atkinson, Donev, and Tobias and by Pukelsheim (especially Chapter 12).**^**Regarding designs for quadratic response-surfaces, the results of Kôno and Kiefer are discussed in Atkinson, Donev, and Tobias. Mathematically, such results are associated with Chebyshev polynomials, "Markov systems", and "moment spaces": See- Karlin, Samuel; Shapley, Lloyd (1953). "Geometry of moment spaces".
*Mem. Amer. Math. Soc*.**12**. - Karlin, Samuel; Studden, William J. (1966).
*Tchebycheff systems: With applications in analysis and statistics*. Wiley-Interscience. - Dette, Holger & Studden, William J. (1997).
*The Theory of canonical moments with applications in statistics, probability, and analysis*. John Wiley & Sons Inc.

- Karlin, Samuel; Shapley, Lloyd (1953). "Geometry of moment spaces".
**^**Peirce, C. S. (1882), "Introductory Lecture on the Study of Logic" delivered September 1882, published in*Johns Hopkins University Circulars*, v. 2, n. 19, pp. 11–12, November 1882, see p. 11,*Google Books*Eprint. Reprinted in*Collected Papers*v. 7, paragraphs 59–76, see 59, 63,*Writings of Charles S. Peirce*v. 4, pp. 378–82, see 378, 379, and*The Essential Peirce*v. 1, pp. 210–14, see 210–1, also lower down on 211.

## References

- Atkinson, A. C.; Donev, A. N.; Tobias, R. D. (2007).
*Optimum experimental designs, with*. Oxford University Press. pp. 511+xvi. ISBN 978-0-19-929660-6.CS1 maint: ref=harv (link)**SAS** - Chernoff, Herman (1972).
*Sequential analysis and optimal design*. Society for Industrial and Applied Mathematics. ISBN 978-0-89871-006-9. - Fedorov, V. V. (1972).
*Theory of Optimal Experiments*. Academic Press. - Fedorov, Valerii V.; Hackl, Peter (1997).
*Model-Oriented Design of Experiments*. Lecture Notes in Statistics.**125**. Springer-Verlag.CS1 maint: ref=harv (link) - Goos, Peter (2002).
*The Optimal Design of Blocked and Split-plot Experiments*. Lecture Notes in Statistics.**164**. Springer.CS1 maint: ref=harv (link) - Kiefer, Jack Carl (1985). Brown; Olkin, Ingram; Sacks, Jerome; et al. (eds.).
*Jack Carl Kiefer: Collected papers III—Design of experiments*. Springer-Verlag and the Institute of Mathematical Statistics. pp. 718+xxv. ISBN 978-0-387-96004-3.CS1 maint: ref=harv (link) - Logothetis, N.; Wynn, H. P. (1989).
*Quality through design: Experimental design, off-line quality control, and Taguchi's contributions*. Oxford U. P. pp. 464+xi. ISBN 978-0-19-851993-5.CS1 maint: ref=harv (link) - Nordström, Kenneth (May 1999). "The life and work of Gustav Elfving".
*Statistical Science*.**14**(2): 174–196. doi:10.1214/ss/1009212244. JSTOR 2676737. MR 1722074.CS1 maint: ref=harv (link) - Pukelsheim, Friedrich (2006).
*Optimal design of experiments*. Classics in Applied Mathematics.**50**(republication with errata-list and new preface of Wiley (0-471-61971-X) 1993 ed.). Society for Industrial and Applied Mathematics. pp. 454+xxxii. ISBN 978-0-89871-604-7.CS1 maint: ref=harv (link) - Shah, Kirti R. & Sinha, Bikas K. (1989).
*Theory of Optimal Designs*. Lecture Notes in Statistics.**54**. Springer-Verlag. pp. 171+viii. ISBN 978-0-387-96991-6.

## Further reading

### Textbooks for practitioners and students

#### Textbooks emphasizing regression and response-surface methodology

The textbook by Atkinson, Donev and Tobias has been used for short courses for industrial practitioners as well as university courses.

- Atkinson, A. C.; Donev, A. N.; Tobias, R. D. (2007).
*Optimum experimental designs, with*. Oxford University Press. pp. 511+xvi. ISBN 978-0-19-929660-6.CS1 maint: ref=harv (link)**SAS** - Logothetis, N.; Wynn, H. P. (1989).
*Quality through design: Experimental design, off-line quality control, and Taguchi's contributions*. Oxford U. P. pp. 464+xi. ISBN 978-0-19-851993-5.CS1 maint: ref=harv (link)

#### Textbooks emphasizing block designs

Optimal block designs are discussed by Bailey and by Bapat. The first chapter of Bapat's book reviews the linear algebra used by Bailey (or the advanced books below). Bailey's exercises and discussion of randomization both emphasize statistical concepts (rather than algebraic computations).

- Bailey, R. A. (2008).
*Design of Comparative Experiments*. Cambridge U. P. ISBN 978-0-521-68357-9. Draft available on-line. (Especially Chapter 11.8 "Optimality") - Bapat, R. B. (2000).
*Linear Algebra and Linear Models*(Second ed.). Springer. ISBN 978-0-387-98871-9. (Chapter 5 "Block designs and optimality", pages 99–111)

Optimal block designs are discussed in the advanced monograph by Shah and Sinha and in the survey-articles by Cheng and by Majumdar.

### Books for professional statisticians and researchers

- Chernoff, Herman (1972).
*Sequential Analysis and Optimal Design*. SIAM. ISBN 978-0-89871-006-9. - Fedorov, V. V. (1972).
*Theory of Optimal Experiments*. Academic Press. - Fedorov, Valerii V.; Hackl, Peter (1997).
*Model-Oriented Design of Experiments*.**125**. Springer-Verlag. - Goos, Peter (2002).
*The Optimal Design of Blocked and Split-plot Experiments*.**164**. Springer. - Goos, Peter & Jones, Bradley (2011).
*Optimal design of experiments: a case study approach*. Chichester Wiley. p. 304. ISBN 978-0-470-74461-1. - Kiefer, Jack Carl. (1985). Brown, Lawrence D.; Olkin, Ingram; Jerome Sacks; Wynn, Henry P (eds.).
*Jack Carl Kiefer Collected Papers III Design of Experiments*. Springer-Verlag and the Institute of Mathematical Statistics. ISBN 978-0-387-96004-3. - Pukelsheim, Friedrich (2006).
*Optimal Design of Experiments*.**50**. Society for Industrial and Applied Mathematics. ISBN 978-0-89871-604-7. Republication with errata-list and new preface of Wiley (0-471-61971-X) 1993 - Shah, Kirti R. & Sinha, Bikas K. (1989).
*Theory of Optimal Designs*.**54**. Springer-Verlag. ISBN 978-0-387-96991-6.

### Articles and chapters

- Chaloner, Kathryn & Verdinelli, Isabella (1995). "Bayesian Experimental Design: A Review".
*Statistical Science*.**10**(3): 273–304. CiteSeerX 10.1.1.29.5355. doi:10.1214/ss/1177009939. - Ghosh, S.; Rao, C. R., eds. (1996).
*Design and Analysis of Experiments*. Handbook of Statistics.**13**. North-Holland. ISBN 978-0-444-82061-7.- "Model Robust Designs".
*Design and Analysis of Experiments*. Handbook of Statistics. pp. 1055–1099. - Cheng, C.-S. "Optimal Design: Exact Theory".
*Design and Analysis of Experiments*. Handbook of Statistics. pp. 977–1006. - DasGupta, A. "Review of Optimal Bayesian Designs".
*Design and Analysis of Experiments*. Handbook of Statistics. pp. 1099–1148. - Gaffke, N. & Heiligers, B. "Approximate Designs for Polynomial Regression: Invariance, Admissibility, and Optimality".
*Design and Analysis of Experiments*. Handbook of Statistics. pp. 1149–1199. - Majumdar, D. "Optimal and Efficient Treatment-Control Designs".
*Design and Analysis of Experiments*. Handbook of Statistics. pp. 1007–1054. - Stufken, J. "Optimal Crossover Designs".
*Design and Analysis of Experiments*. Handbook of Statistics. pp. 63–90. - Zacks, S. "Adaptive Designs for Parametric Models".
*Design and Analysis of Experiments*. Handbook of Statistics. pp. 151–180.

- "Model Robust Designs".
- Kôno, Kazumasa (1962). "Optimum designs for quadratic regression on
*k*-cube" (PDF).*Memoirs of the Faculty of Science. Kyushu University. Series A. Mathematics*.**16**(2): 114–122. doi:10.2206/kyushumfs.16.114.

### Historical

- Gergonne, J. D. (November 1974) [1815]. "The application of the method of least squares to the interpolation of sequences".
*Historia Mathematica*(Translated by Ralph St. John and S. M. Stigler from the 1815 French ed.).**1**(4): 439–447. doi:10.1016/0315-0860(74)90034-2. - Stigler, Stephen M. (November 1974). "Gergonne's 1815 paper on the design and analysis of polynomial regression experiments".
*Historia Mathematica*.**1**(4): 431–439. doi:10.1016/0315-0860(74)90033-0. - Peirce, C. S (1876). "Note on the Theory of the Economy of Research".
*Coast Survey Report*: 197–201. (Appendix No. 14). NOAA PDF Eprint. Reprinted in*Collected Papers of Charles Sanders Peirce*.**7**. 1958. paragraphs 139–157, and in Peirce, C. S. (July–August 1967). "Note on the Theory of the Economy of Research".*Operations Research*.**15**(4): 643–648. doi:10.1287/opre.15.4.643. JSTOR 168276. - Smith, Kirstine (1918). "On the Standard Deviations of Adjusted and Interpolated Values of an Observed Polynomial Function and its Constants and the Guidance They Give Towards a Proper Choice of the Distribution of the Observations".
*Biometrika*.**12**(1/2): 1–85. doi:10.2307/2331929. JSTOR 2331929.