| 解整数规划问题的目标收敛法 |
| |
| 引用本文： | 朱承学,李崧,肖鸣宇.解整数规划问题的目标收敛法[J].广西科学,2005,12(1):14-17. |
| |
| 作者姓名： | 朱承学 李崧 肖鸣宇 |
| |
| 作者单位： | 中南大学信息科学与工程学院,湖南长沙,410083;北海鑫诚建设监理有限责任公司,广西北海,536000;中南大学数学与计算技术学院,湖南长沙,410083 |
| |
| 摘 要： | 提出基于目标收敛法的整数规划求解方法．该求解方法从整系数目标函数值一定为整数这一性质出发，对目标函数值进行逐步约束，使得每一步迭代均在上一步问题的可行域中割去一块不包含原规划问题整数可行解的区域，从而使可行域逐步缩小最终得到整数最优解．目标收敛法还可与割平面法、分枝估界等方法结合起来使用，从而加速求解过程．
|
| 关 键 词： | 线性规划 整数规划 目标收敛法 |
| 文章编号： | 1005-9164(2005)01-0014-04 |
| 收稿时间： | 2004/7/27 0:00:00 |
| 修稿时间： | 2004年7月27日 |
Object Convergence Approach for Solving of Integer Programming Problems |
| |
| Zhu Chengxue,Li Song and Xiao Mingyu.Object Convergence Approach for Solving of Integer Programming Problems[J].Guangxi Sciences,2005,12(1):14-17. |
| |
| Authors: | Zhu Chengxue Li Song and Xiao Mingyu |
| |
| Institution: | Zhu Chengxue~1,Li Song~2,Xiao Mingyu~3 |
| |
| Abstract: | A new method for solving integer programming,Object Convergence Approach,is presented.Based on the feature that the value of the objective function must be integral if the coefficients of the objective function are all integral,the method constrains the value of the objective function step by step.In each step,a region,not containing feasible integral points of the original programming,is cut from the feasible region, which diminishes gradually until the optimal point is obtained.Also,the method can be combined well with branch and bound method and cutting plane approach to accelerate the solving process. |
| |
| Keywords: | linear programming integer programming object convergence approach |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《广西科学》浏览原始摘要信息 |
| 点击此处可从《广西科学》下载免费的PDF全文 |
|
