Mixed Integer Nonlinear Bilevel Programming: Deterministic Global Optimization

2012 ◽  
Keyword(s):  
Global Optimization ◽  
Bilevel Programming ◽  
Mixed Integer ◽  
Deterministic Global Optimization

On Global Feasible Search for Global Design Optimization With Application to Generalized Polynomial Models

1992 ◽  
Author(s):  
Chihsiung Lo ◽  
Panos Y. Papalambros
Keyword(s):  
Global Optimization ◽  
Design Optimization ◽  
Model Transformation ◽  
Special Problem ◽  
Search Algorithms ◽  
Deterministic Global Optimization ◽  
Generalized Polynomial ◽  
Polynomial Models ◽  
Feasible Solutions ◽  
Global Design Optimization

Abstract A powerful 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.

Sign in / Sign up

Export Citation Format

Share Document