线性0-1规划模型的排序解法

A Permutation Algorithm for the Linear 0-1 Programming Model

针对 0 1规划模型提出了一种新的解法 ,即排序法。它利用目标函数变量系数绝对值大小的相对关系 ,对无约束条件解进行排序 ,在最小解集中寻找最优解 ,以加快收敛速度。

This paper presents a new method, the permutation algorithm, for solving the linear 0 1 programming model. In this algorithm, the unconstrained solutions are permuted in a special order according to the absolute values of variable coefficients of the objective function so as to search the optimum solution in the aggregate of minimums with an accelerated convergence speed.