Abstract
The paper gives a definition of the filled function for nonlinear integer programming. This definition is modified from that of the global convexized filled function for continuous global optimization. A filled function with only one parameter which satisfies this definition is presented. We also discuss the properties of the proposed function and give a filled function method to solve the nonlinear integer programming problem. The implementation of the algorithm on several test problems is reported with satisfactory numerical results.
Original language | English |
---|---|
Pages (from-to) | 200-210 |
Number of pages | 11 |
Journal | Journal of Computational and Applied Mathematics |
Volume | 181 |
Issue number | 1 |
DOIs | |
Publication status | Published - 1 Sept 2005 |
Externally published | Yes |
Keywords
- Filled function
- Global minimizer
- Global optimization
- Integer programming
- Local minimizer