求解一类整数规划问题的序列定界组合算法

摘要

文首先提出了二维组合的定义及其生成算法，并将定界组合算法推广到rn设计变量可以取任意多个整数值的情形，采用多级字典序的生成算法，按目标函数rn的一定排列顺序有规律地生成所有组合，在生成组合的过程中，采用序列定界组合rn算法有效地删除绝大多数非可行组合和非最优组合，大大地减少了搜索组合的个rn数，具有比较高的计算效率.%In this paper,an algorithm is given for solving a class of integer programming problems.rnThis algorithm generates all combinations of objective functions in a certain magnitude order,using a rnmulti-level generating method of preceding for high place. In the course of combination generation ,the rnalgorithm eliminates a iarge number of infeasible and non-optimal combinations by use of the sequenrntial delimitative and combinatorial method. As a result,a higher computational efficiency is achieved.