On Global Feasible Search for Global Design Optimization with Application to Generalized Polynomial 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 117(3), 402-408 (Sep 01, 1995) (7 pages) doi:10.1115/1.2826693 History: Received February 01, 1995; Online December 11, 2007


A key idea for deterministic global optimization is the use of global feasible search, namely, algorithms that guarantee finding feasible solutions of nonconvex problems or prove that none exists. In this article, a set of conditions for global feasible search algorithms is established. The utility of these conditions is demonstrated on two algorithms that solve special problem classes globally. Also, a new model transformation is shown to convert a generalized polynomial problem into one of the special classes above. A flywheel design example illustrates the approach. A sequel article provides further computational details and design examples.

Copyright © 1995 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