| 邻域整点搜索法求解整数规划 |
| |
| 引用本文： | 郭永发,宛士春,陈农,陶凤玲.邻域整点搜索法求解整数规划[J].数学的实践与认识,2006,36(11):100-104. |
| |
| 作者姓名： | 郭永发 宛士春 陈农 陶凤玲 |
| |
| 作者单位： | 青海大学基础部,青海,西宁,810016 |
| |
| 基金项目： | 教育部人文社会科学规划项目 |
| |
| 摘 要： | 从剖析线性规划的优化机理入手,将纯整数规划分为标准型和非标型两类.首先以标准型纯整数规划为突破口,提出一种新的解法,并在理论上加以证明,然后将其拓广延伸,用于求解非标准型纯整数规划和混合整数规划.这种新解法命名为松驰最优解邻域整点搜索法,属于常规解法,但在简捷高效方面,远胜过现有的两种常规解法—分枝定界法和割平面法.
|
| 关 键 词： | 线性规划 整数规划 松驰最优解 邻域 |
| 修稿时间： | 2004年9月29日 |
Neighborhood Integer Point Search Method to Solve Integer Programming |
| |
| GUO Yong-fa,WAN Shi-chun,CHEN Nong,TAO Fen-lin.Neighborhood Integer Point Search Method to Solve Integer Programming[J].Mathematics in Practice and Theory,2006,36(11):100-104. |
| |
| Authors: | GUO Yong-fa WAN Shi-chun CHEN Nong TAO Fen-lin |
| |
| Abstract: | Authors gave a new method called neighborhood integer point search,which was proved in theory and extension to solve non-standard pure integer and mixed integer programming.This method was more shortcut and efficient than present two regular methods—Brach-bound and cutting plane. |
| |
| Keywords: | linear programming integer programming relaxation optimum solution neighborhood |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
