论文部分内容阅读
目前,关于整数规划的求解方法大多数因计算量过大而带来了困难,本文提出了一种与传统方法不同的求解线性整数规划的直接搜索方法,这种方法选取多个整数化的下降方向作为搜索方向;取整数化的步长因子为步长,保证搜索点为整数点,保证函数值下降.方法的设想较有意思,对求解非线性整数规划有启发作用.这种方法计算量较小,易于在计算机上实现.通过实例在计算机上考核效果较好.
At present, most of the methods for solving integer programming are difficult due to the large amount of computation. This paper presents a different direct search method for solving linear integer programming which is different from the traditional method. Direction as the search direction; take the integer step size factor as the step, to ensure that the search point is an integer point, to ensure that the value of the function decreases. The idea of the method is more interesting and has an enlightening effect on solving nonlinear integer programming. Small, easy to implement on the computer.On the example through the computer assessment better.