| 整数规划的交集及交集余集解法 |
| |
| 引用本文： | 冯振笑,柯越华.整数规划的交集及交集余集解法[J].中国石油大学学报(自然科学版),2001,25(2). |
| |
| 作者姓名： | 冯振笑 柯越华 |
| |
| 作者单位： | 1. 石油大学图书馆,
2. 胜利油田评估咨询公司, |
| |
| 摘 要： | 整数规划问题为多维时 ,理论上可以用分枝定界方法与割平面方法求解。但是这两种方法难以理解 ,而且求解过程繁琐。为此提出了交集、交集余集枚举法 ,阐述了这种方法的原理 ,并给出计算范例。
|
| 关 键 词： | 整数规划 交集 枚举 最优解 |
INTEGRAL PROGRAM SOLVING PROCEDURE |
| |
| FENG Zhen-xiao,KE Yue-hua.INTEGRAL PROGRAM SOLVING PROCEDURE[J].Journal of China University of Petroleum,2001,25(2). |
| |
| Authors: | FENG Zhen-xiao KE Yue-hua |
| |
| Institution: | FENG Zhen xiao and KE Yue hua |
| |
| Abstract: | When the integral program problem is multi dimensional, branch boundary method and cutting plane approach are applicable for solving the problem. However, it is difficult to understand these two methods, and the solving procedure is too complicated. In this article, these two methods are analyzed, and some new methods of simultaneous set, simultaneous and complementary set enumeration are proposed. The theory of the new method is described, and some calculating examples are given. |
| |
| Keywords: | integral program simultaneous set enumeration method optimal solution |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
