| 引用本文： |
-
朱承学,李崧,肖鸣宇.解整数规划问题的目标收敛法[J].广西科学,2005,12(1):14-17. [点击复制]
- Zhu Chengxue,Li Song,Xiao Mingyu.Object Convergence Approach for Solving of Integer Programming Problems[J].Guangxi Sciences,2005,12(1):14-17. [点击复制]
|
|
| 摘要: |
| 提出基于目标收敛法的整数规划求解方法.该求解方法从整系数目标函数值一定为整数这一性质出发,对目标函数值进行逐步约束,使得每一步迭代均在上一步问题的可行域中割去一块不包含原规划问题整数可行解的区域,从而使可行域逐步缩小最终得到整数最优解.目标收敛法还可与割平面法、分枝估界等方法结合起来使用,从而加速求解过程. |
| 关键词: 线性规划 整数规划 目标收敛法 |
| DOI： |
| 投稿时间：2004-07-27修订日期：2004-12-22 |
| 基金项目: |
|
| Object Convergence Approach for Solving of Integer Programming Problems |
|
Zhu Chengxue1, Li Song2, Xiao Mingyu3
|
| (1.Coll. of Info. Sci. & Engi., Central South Univ., Changsha, Hunan, 410083, China;2.Beihai Xincheng Project Management Co. LTD, Beihai, Guangxi, 536000, China;3.Coll. of Math. & Comp. Tech., Central South Univ., Changsha, Hunan, 410083, China) |
| 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. |
| Key words: linear programming integer programming object convergence approach |
