Constructing exact d-optimal experimental designs by simulated annealing

Research output: Contribution to journalArticlepeer-review

43 Scopus citations


Exact optimal designs have generally been constructed using a finite design space and various exchange algorithms, which are subject to premature convergence. Branch-and-bound methods guarantee optimal designs, but are only computationally feasible for small problems. We apply the generalized simulated annealing algorithm to the construction of exact optimal designs, and evaluate its effectiveness on both finite and continuous design spaces.

Original languageEnglish (US)
Pages (from-to)329-359
Number of pages31
JournalAmerican Journal of Mathematical and Management Sciences
Issue number3-4
StatePublished - Jan 1 1988


  • D-optimality
  • Exchange algorithms
  • Nonlinear optimization
  • Optimal designs


Dive into the research topics of 'Constructing exact d-optimal experimental designs by simulated annealing'. Together they form a unique fingerprint.

Cite this