A Cutting Plane Branch and Bound Algorithm for Solving Nonlinear Integer Programming Problems

For a class of nonlinear integer programming problems,a cutting plane branch-and-bound method is proposed.In this method,the nonlinear feasible region were linearizet by the cutting plane equation.At the same time,the feasible direction of the subproblems was determined and the cutting plane was generated,which can cut off feasible region of no integer solutions and narrow the feasible region.This method can reduce the number of branches.