摘要
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.
| 源语言 | 英语 |
|---|---|
| 页（从-至） | 200-210 |
| 页数 | 11 |
| 期刊 | Journal of Computational and Applied Mathematics |
| 卷 | 181 |
| 期 | 1 |
| DOI | |
| 出版状态 | 已出版 - 1 9月 2005 |
| 已对外发布 | 是 |
指纹
探究 'A filled function method for finding a global minimizer on global integer optimization' 的科研主题。它们共同构成独一无二的指纹。引用此
Shang, Y. L., & Zhang, L. S. (2005). A filled function method for finding a global minimizer on global integer optimization. Journal of Computational and Applied Mathematics, 181(1), 200-210. https://doi.org/10.1016/j.cam.2004.11.030