整数规划的交集及交集余集解法

INTEGRAL PROGRAM SOLVING PROCEDURE

整数规划问题为多维时 ,理论上可以用分枝定界方法与割平面方法求解。但是这两种方法难以理解 ,而且求解过程繁琐。为此提出了交集、交集余集枚举法 ,阐述了这种方法的原理 ,并给出计算范例。

When the integral program problem is multi dimensional, branch boundary method and cutting plane approach are applicable for solving the problem. However, it is difficult to understand these two methods, and the solving procedure is too complicated. In this article, these two methods are analyzed, and some new methods of simultaneous set, simultaneous and complementary set enumeration are proposed. The theory of the new method is described, and some calculating examples are given.