NONLINEAR INTEGER PROGRAMMING AND GLOBALOPTIMIZATION

Various approaches have,been developed for solving a variety of continuousglobal optimization problems. But up to now, less work has been devoted to solvingnonlinear integer programming problems due to the inherent difficulty. This papermanages to transform the general nonlinear integer programming problem into an"equivalent" special continuous global minimization problem. Thus any effectiveglobal optimization algorithm can be used to solve nonlinear integer programmingproblems. This result will also promote the research on global optimization. Wepresent an interval Branch-and-Bound algorithm. Numerical experiments showthat this approach is efficient.