Global optimization algorithms for generalized polynomial design models using a global feasible search approach was discussed in a previous article. A new convex cutting plane algorithm (CONCUT) based on global feasible search and with improved performance is presented in this sequel article. Computational results of the CONCUT algorithm compared to one using linear cuts (LINCUT) are given for various test problems. Two design examples, a speed reducer and a corrugated bulkhead design, illustrate the application of the algorithms.

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