Chapter Contents
Chapter Contents
Previous
Previous
Next
Next
Introduction to the OPTEX Procedure

Features

This section summarizes key features of 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

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

Table 23.1: Information-based Optimality Criteria
Criterion Goal Formula
D-optimalityMaximize determinant of the\max | X'X|
 information matrix 
   
A-optimalityMinimize sum of the variancesmin trace(X'X)-1
 of estimated coefficients 

Table 23.2: Distance-based Optimality Criteria
Criterion Goal Formula
U-optimalityMinimize distance from \min \sum_{x\in {\cal C}}
 d(x,{\cal D})
 design to candidates 
   
S-optimalityMaximize distance \min \sum_{y\in {\cal D}}
 d(y,{\cal D} - y)
 between design points 

Chapter Contents
Chapter Contents
Previous
Previous
Next
Next
Top
Top

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