|
This paper focuses on the construction of computer-generated designs on irregularly-shaped, constrained regions. Overviews of the Fedorov exchange algorithm (FEA) and other exchange algorithms for the construction of D-optimal designs are given. A faster implementation of the FEA is presented, which is referred to as fast-FEA (denoted FFEA). The FFEA was applied to construct D-optimal designs for several published examples with constrained experimental regions. Designs resulting from the FFEA are more D-efficient than published designs, and provide benchmarks for future comparisons of design construction algorithms. The construction of G-optimal designs for constrained regions is also discussed and illustrated with a published example. |
|