论文部分内容阅读
本文整数规划问题给出一种搜索方法,它类似于求解连续变量优化问题的迭代方法,从一个好的初始可行解出发,寻找一个搜索方向,沿着这个方向求出改进的可行解,然后又开始下一次迭代。此方法简单易行,可以求出问题的最优解或近似最优解,对于整数线性规划问题和整数非线性规划问题的求解都适用,并且容易推广到求解大规校整数线性规划问题。文中附有计算例子,说明方法是有效的。
The integer programming problem in this paper gives a search method that is similar to the iterative method for solving continuous variable optimization problems. Starting from a good initial feasible solution, we search for a search direction and find a feasible solution along this direction. Then, Start the next iteration. This method is simple and easy, and can find the optimal solution or approximate optimal solution of the problem. It is suitable for the integer linear programming problem and the integer nonlinear programming problem, and can easily be generalized to solve the integer linear programming problem of large-scale school. Attached with the calculation example, the method is effective.