| 整数线性规划问题解法探究 |
| |
| 引用本文： | 张天鹤. 整数线性规划问题解法探究[J]. 湖州职业技术学院学报, 2005, 3(4): 74-76 |
| |
| 作者姓名： | 张天鹤 |
| |
| 作者单位： | 无锡商业职业技术学院,基础部,无锡,214063 |
| |
| 摘 要： | 整数线性规划是线性规划问题的重要组成部分，由于整数线性规划问题还没有找到一种有效的解法，目前只能求解中小规模的整数线性规划问题，而建立在线性规划理论基础上的整数解集筛选法是求解整数线性规划问题的一种比较简洁而有效的方法。
|
| 关 键 词： | 整数线性规划 松弛问题 整数点 整数解集筛选法 |
| 文章编号： | 1672-2388（2005）-0074-03 |
| 收稿时间： | 2004-10-17 |
| 修稿时间： | 2004-10-17 |
On Solutions to Integer Linear Programming |
| |
| ZHANG Tian-he. On Solutions to Integer Linear Programming[J]. Journal of Huzhou Vocational and Technological College, 2005, 3(4): 74-76 |
| |
| Authors: | ZHANG Tian-he |
| |
| Affiliation: | Wuxi Vocational Institute of Commercial Technology, Wuxi 214063, China |
| |
| Abstract: | Integer liner programming is an important part of linear programming. As no effective solution to integer linear programming has been found, we only can solve such medium scale or small scale problems. Integral solutions set screening, which is based on Linear Programming Theory, is a more convenient and effective solution to such problems. |
| |
| Keywords: | integer linear programming relaxation integer point integral solution set screening |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
