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. A speed reducer design example illustrates the application of the algorithms.
A Convex Cutting Plane Algorithm for Global Solution of Generalized Polynomial Optimal Design Models
- Views Icon Views
- Share Icon Share
- Search Site
Lo, C., and Papalambros, P. Y. (March 1, 1996). "A Convex Cutting Plane Algorithm for Global Solution of Generalized Polynomial Optimal Design Models." ASME. J. Mech. Des. March 1996; 118(1): 82–88. https://doi.org/10.1115/1.2826861
Download citation file: