Abstract
Factorial designs are arguably the most widely used designs in scientific investigations. Generalized minimum aberration (GMA) and uniformity are two important criteria for evaluating both regular and non-regular designs. The generation of GMA designs is a non-trivial problem due to the sequential optimization nature of the criterion. Based on an analytical expression between the generalized wordlength pattern and a uniformity measure, this paper converts the generation of GMA designs to a constrained optimization problem, and provides effective algorithms for solving this particular problem. Moreover, many new designs with GMA or near-GMA are reported, which are also (nearly) optimal under the uniformity measure.
Original language | English (US) |
---|---|
Pages (from-to) | 75-84 |
Number of pages | 10 |
Journal | Journal of Complexity |
Volume | 25 |
Issue number | 1 |
DOIs | |
State | Published - Feb 2009 |
All Science Journal Classification (ASJC) codes
- Algebra and Number Theory
- Statistics and Probability
- Numerical Analysis
- General Mathematics
- Control and Optimization
- Applied Mathematics