对求解整数规划方法的新探索  

New exploration to the methods of solving integer programming

作　　者：宛士春[1] 郭永发[1] 

机构地区：[1]青海大学,青海西宁810016

出　　处：《青海大学学报（自然科学版）》2003年第6期63-67,共5页Journal of Qinghai University(Natural Science)

基　　金：教育部人文社会科学研究"十五"规划第一批研究项目(O1JA630076)

摘　　要：借鉴分枝定界法求解整数规划的基本原理和目标排序法求解0—1规划的思路,在完成一系列理论分析和证明之后,提出求解整数规划的简捷有效的新方法—松驰最优解邻域整点搜索法。In the paper,author made use of basic principle of solving integer programming by brach-bound method and thought of solving 0-1programming by objective ordering, put forward a new method in solution neighborhood integer point search method, which is most shortcut and efficient so far after (fini-)shing a series of theory analysis and proof.

关 键 词：整数规划 松驰问题 单纯形法 分枝定界法 邻域 

分 类 号：O241.6[理学—计算数学]