Chapter Contents |
Previous |
Next |

Introduction to the OPTEX Procedure |

The OPTEX procedure offers various criteria for searching a design;
these criteria are summarized in Table 23.1 and
Table 23.2. In the formulas for
these criteria, *X* denotes the design matrix, *C* the set
of candidate points, and *D* the set of design points. The
default criterion is D-optimality.
You can also use the OPTEX procedure to generate G- and I-efficient designs.

The OPTEX procedure also offers a variety of search algorithms, ranging from a simple sequential search (Dykstra 1971) to the computer-intensive Fedorov algorithm (Fedorov 1972, Cook and Nachtsheim 1980). You can customize many aspects of the search, such as the initialization method and the number of iterations.

You can use the full general linear modeling facilities of the GLM procedure to specify a model for your design, allowing for general polynomial effects as well as classification or ANOVA effects. Optionally, you can specify

- design points to be optimally augmented
- fixed covariates (for example, blocks) for the design
- prior precisions for Bayesian optimal design

The OPTEX procedure is an interactive procedure. After specifying
an initial design, you can submit additional statements without
reinvoking the OPTEX procedure. Once you have found a design, you can

- examine the design
- output the design to a data set
- change the model and find another design
- change the characteristics of the search and find another design

Criterion |
Goal |
Formula |

D-optimality | Maximize determinant of the | |

information matrix | ||

A-optimality | Minimize sum of the variances | min trace(X'X)^{-1} |

of estimated coefficients |

Criterion |
Goal |
Formula |

U-optimality | Minimize distance from | |

design to candidates | ||

S-optimality | Maximize distance | |

between design points |

Chapter Contents |
Previous |
Next |
Top |

Copyright © 1999 by SAS Institute Inc., Cary, NC, USA. All rights reserved.