A filled function method for constrained nonlinear integer programming
Yongjian Yang - Department of Mathematics, Shanghai University, Shanghai 200444, China (email)
Abstract: A filled function method is presented in this paper to solve constrained nonlinear integer programming problems. It is shown that for a given non-global local minimizer, a better local minimizer can be obtained by local search staring from an improved initial point which is obtained by locally solving a box-constrained integer programming problem. Several illustrative numerical examples are reported to show the efficiency of the present method.
Keywords: Constrained nonlinear integer programming, filled function
method, discrete global optimization.
Received: September 2006; Revised: January 2008; Available Online: April 2008.
2015 Impact Factor.776