Identifying a Global Optimizer with Filled Function for Nonlinear Integer Programming
This paper presents a filled function method for finding a global optimizer of integer programming problem. The method contains two phases: the local minimization phase and the filling phase. The goal of the former phase is to identify a local minimizer of the objective function, while the filling p...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2011-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2011/171697 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This paper presents a filled function method for finding a global optimizer of integer programming problem. The method contains two phases: the local minimization phase and the filling phase. The goal of the former phase is to identify a local minimizer of the objective function, while the filling phase aims to search for a better initial point for the first phase with the aid of the filled function. A two-parameter filled function is proposed, and its properties are investigated. A corresponding filled function algorithm is established. Numerical experiments on several test problems are performed, and preliminary computational results are reported. |
|---|---|
| ISSN: | 1026-0226 1607-887X |