TY - JOUR
AU - Nguyen, Nam‐Ky
AB - Appl. Statist. (1994) 43. No.4. pp. 669-678 Algorithm AS 295 By Alan J. Millert CSIRO Division of Mathematics and Statistics, Clayton, Australia and Nam-Ky Nguyen CSIRO Biometrics Unit, Melbourne, Australia [Received October 1990. Final revision October 1993) Keywords: Design with blocking; D-optimality; Fedorov exchange algorithm; Optimal design Language Fortran 77 Description and Purpose Optimal design algorithms are particularly useful for creating designs in difficult situations, such as when experimental conditions enforce inconvenient block sizes. Several packages are now available for computer-aided design of experiments on personal computers (pes) either in the form of Fortran source code or as easy-to-use commercial packages. Most of these packages could not find a good design for say 3 2 a 2 x 3 x 14 experiment in blocks of size 10. This kind of requirement is not unusual where there are say 14 species of timber or types of cheese, and the block size is dictated by the number of experimental runs which can be carried out in one day or from one batch of material. Our algorithm allows blocking, including the use of unequal block sizes. Another important application is in augmenting an experiment which has already been carried out. Our algorithm 
TI - A Fedorov Exchange Algorithm for D‐Optimal Design
JF - Journal of the Royal Statistical Society Series C (Applied Statistics)
DO - 10.2307/2986264
DA - 1994-12-01
UR - https://www.deepdyve.com/lp/oxford-university-press/a-fedorov-exchange-algorithm-for-d-optimal-design-pMowYFf0oV
SP - 669
EP - 677
VL - 43
IS - 4
DP - DeepDyve
ER -