A Convex Cutting Plane Algorithm for Global Solution of Generalized Polynomial Optimal Design Models

[+] Author and Article Information
Chihsiung Lo, P. Y. Papalambros

Design Laboratory, Department of Mechanical Engineering and Applied Mechanics, The University of Michigan, Ann Arbor, MI 48109

J. Mech. Des 118(1), 82-88 (Mar 01, 1996) (7 pages) doi:10.1115/1.2826861 History: Received February 01, 1995; Revised July 01, 1995; Online December 11, 2007


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.

Copyright © 1996 by The American Society of Mechanical Engineers
Your Session has timed out. Please sign back in to continue.





Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In