Abstract
This paper presents the results of a study in which the computer algorithm DETMAX was used for the purpose of constructing n-run “D-optimal” designs over a cubic region of interest for the first-order model E(y) = β0 + β0 x 1 + … + β p x p . These results suggest some general “rules” (actually conjectures) for the construction of such designs. For p ≤ 9, all but 12 combinations of n and p are covered by these “rules;” the 12 exceptions are discussed separately. The resolution IV designs obtained by folding over these “D-optimal” first-order designs are also discussed and are shown to compare favorably with designs previously published.