Identifying a Global Optimizer with Filled Function for Nonlinear Integer Programming | Zendy

Weixiang Wang | Zendy; Youlin Shang | Zendy; Liansheng Zhang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Identifying a Global Optimizer with Filled Function for Nonlinear Integer Programming

Author(s) -

Weixiang Wang,

Youlin Shang,

Liansheng Zhang

Publication year - 2011

Publication title -

discrete dynamics in nature and society

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.264

H-Index - 39

eISSN - 1607-887X

pISSN - 1026-0226

DOI - 10.1155/2011/171697

Subject(s) - integer programming , integer (computer science) , mathematical optimization , nonlinear system , nonlinear programming , computer science , function (biology) , mathematics , physics , programming language , biology , quantum mechanics , evolutionary biology

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research