| 求解整数规划Surrogate对偶问题的一种算法 |
| |
| 引用本文： | 唐焕文,倪明放. 求解整数规划Surrogate对偶问题的一种算法[J]. 大连理工大学学报, 1987, 0(4) |
| |
| 作者姓名： | 唐焕文 倪明放 |
| |
| 作者单位： | 大连工学院应用数学系(唐焕文)，大连工学院应用数学系(倪明放) |
| |
| 摘 要： | 本文讨论整数线性规划的Ｓｕｒｒｏｇａｔｅ对偶问题，给出了求解Ｓｕｒｒｏｇａｔｅ对偶问 题的一种算法，论述了该算法具有的某些良好性质。计算结果说明：用该算法求解 Ｓｕｒｒｏｇａｔｅ对偶问题时，所解的背包问题的次数比较少，所存在的对偶间隙也较 小。
|
| 关 键 词： | 整数规划 线性规划 算法/surrogate对偶 |
An Algorithm for Solving Surrogate Dual Problem in Integer Iinear Programming |
| |
| Tang Huanwen. Ni Mingfang. An Algorithm for Solving Surrogate Dual Problem in Integer Iinear Programming[J]. Journal of Dalian University of Technology, 1987, 0(4) |
| |
| Authors: | Tang Huanwen. Ni Mingfang |
| |
| Affiliation: | Department of Applied Mathematics. DIT |
| |
| Abstract: | This article studies Surrogate dual problem in integer linear program ming, Some relationships between calculation of Surrogate multiplier and the optimal value of the knapsack problem are discussed. An algo rithm for solving Surrogate dual problem is described and proofs of so me better quaalities of the algorithm are given. When the algorithm is applied to solve Surrogate dual problems, computationtal results show that the number or solving knapsack problems are fewer and the dual gap is smaller. |
| |
| Keywords: | integer programming linear programming algorithm Surrogate duality |
| 本文献已被 CNKI 等数据库收录！ |
