| 整数线性规划问题的一个新算法 |
| |
| 引用本文： | 谢政.整数线性规划问题的一个新算法[J].国防科技大学学报,1992,14(1):99-103. |
| |
| 作者姓名： | 谢政 |
| |
| 作者单位： | 国防科技大学系统工程与应用数学系 |
| |
| 摘 要： | 本文给出求解整数线性规划问题的一个算法。基本思想是通过求出其伴随线性规划问题的最优单纯形表,把整数线性规划化成正整数系数的不定方程,然后从不定方程的非负整数解集中选取一组满足整数线性规划的约束条件的解,作为整数线性规划的最优解。
|
| 关 键 词： | 运筹学 算法 数论 整数线性规划 线性规划 单纯形表 不定方程 |
| 收稿时间： | 1991/3/16 0:00:00 |
A New Algorithm for Solving the Problem of Integer Linear Programming (ILP) |
| |
| Xie Zheng.A New Algorithm for Solving the Problem of Integer Linear Programming (ILP)[J].Journal of National University of Defense Technology,1992,14(1):99-103. |
| |
| Authors: | Xie Zheng |
| |
| Institution: | Department of system Engineering and Applied Mathematics |
| |
| Abstract: | An algorithm for soving ILP problems is given in this paper. According to the optimal simplex tableau of the associate LP, we transform ILP into an indeterminate equation with positive integer coefficients. We then choose a solution, which satisfies the constraint conditions of ILP, from the nonnegative integer solution set of the indeterminate equation as an optimal solution of ILP. |
| |
| Keywords: | operations reserach algorithms number theory integer linear programming (ILP) linear programming (LP) simplex tableaus indeterminate equations |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《国防科技大学学报》浏览原始摘要信息 |
| 点击此处可从《国防科技大学学报》下载免费的PDF全文 |
