给出了几个求解整数非线性规划问题局部极小点的算法,并根据具体的算例比较了它们的优劣性。
In this paper,several algorithms for solving local minimum points in integer nonlinear programming are introduced,and their advantages and disadvantages are stated respectively by detailed examples.