非线性整数规划多个解的一种寻找方法

A Way to Find Some Optimal Solutions of Nonlinear Integer Programming

为了找出整数规划问题所有的最优解(或者问题仅仅只有一个最优解),根据CBcuts的理论,利用0-1线性化方法将非线性整数规划问题转化为0-1整数规划问题,进而可以逐次利用CB cuts排除一系列最优解,从而能求出原问题所有的最优解。同时研究了其理论可行性,算例结果也阐释了这种方法的有效性和可行性。

We need to find all optimal solutions （or only one optimal solution） for the integer programming problem. According to the theory of CB cuts, it can use 0-1 linearization method to converse the nonlinear problem into a 0-1 integer programming problem, then exclude a series of optimal solutions with CB cuts to find all the optimal solution of the original problem. At the same time, this paper studies the feasibility of the theory, numerical results also illustrate the effectiveness and feasibility of this approach.