论文信息 - A FILLED FUNCTION METHOD FOR BOX CONSTRAINED NONLINEAR INTEGER PROGRAMMING

A FILLED FUNCTION METHOD FOR BOX CONSTRAINED NONLINEAR INTEGER PROGRAMMING

A newlled function method is presented in this paper to solve box-constrained nonlinear integer programming problems. It is shown that for a given non-global local minimizer, a better local min- imizer can be obtained by local search starting from an improved initial point which is obtained by locally solving a box-constrained integer pro- gramming problem. Several illustrative numerical examples are reported to show the efficiency of the present method.

Youjiang Lin | Yongjian Yang | Yongjian Yang | Youjiang Lin

[1] J. F. Price,et al. On descent from local minima , 1971 .

[2] R. Ge,et al. The globally convexized filled functions for global optimization , 1990 .

[3] Wenxing Zhu. Unsolvability of some optimization problems , 2006, Appl. Math. Comput..

[4] Panos M. Pardalos,et al. Introduction to Global Optimization , 2000, Introduction to Global Optimization.

[5] Renpu Ge,et al. A Filled Function Method for Finding a Global Minimizer of a Function of Several Variables , 1990, Math. Program..

[6] Yong Yao,et al. Dynamic tunneling algorithm for global optimization , 1989, IEEE Trans. Syst. Man Cybern..

[7] Bedri C. Cetin,et al. Terminal repeller unconstrained subenergy tunneling (trust) for fast global optimization , 1993 .

[8] Wen-xing Zhu,et al. An approximate algorithm for nonlinear integer programming , 1998, Appl. Math. Comput..

[9] Klaus Schittkowski,et al. More test examples for nonlinear programming codes , 1981 .

[10] R. Ge,et al. A continuous approach to nonlinear integer programming , 1989 .

[11] A. V. Levy,et al. The Tunneling Algorithm for the Global Minimization of Functions , 1985 .