An Approximate Method for Nonlinear Integer Programming Problems

摘要

In this paper we propose an approximate method for nonlinear integer programming problems. A nonlinear in- teger programming problem is written as a multidimen- sional nonlinear knapsack problem. The multidimensional nonlinear knapsack problem can be solved even if the objective and constraint functions of the original nonlinear integer programming problems are nonconvex and undif- ferentiable. It is difficult to solve large-scale multidimen- sional nonlinear knapsack problems exactly.