A new design optimization method is described for finding global solutions of models with a nonconvex objective function and nonlinear constraints. All functions are assumed to be generalized polynomials. By introducing new variables, the original model is transformed into one with a linear objective function, one convex and one reversed convex constraint. A two-phase algorithm that includes global feasible searches and local optimal searches is used for globally optimizing the transformed model. Several examples illustrate the method.

This content is only available via PDF.
You do not currently have access to this content.