| 纯整数规划的一种解法 |
| |
| 引用本文： | 王顺庆,安见才让.纯整数规划的一种解法[J].西北民族学院学报,1998(1). |
| |
| 作者姓名： | 王顺庆 安见才让 |
| |
| 作者单位： | 西北民族学院数学系，西北民族学院数学系 兰州，730030，兰州，730030 |
| |
| 摘 要： | 给出了纯整数规划问题的一种异于传统方法的解法。其特点是引进的线性约束条件是从目标函数中产生的。
|
| 关 键 词： | 纯整数规划 目标函数 单纯形法 对偶单纯形法 |
The Solving Process of Pure Integer Linear Programming |
| |
| Wang Shunqing An Jiancairang.The Solving Process of Pure Integer Linear Programming[J].Journal of Northwest Minorities University(Natural Science ),1998(1). |
| |
| Authors: | Wang Shunqing An Jiancairang |
| |
| Abstract: | It is given the solving process of pure integer linear programming which is different from traditional methods in this paper.It's speciality is to bring in linear constraint condintion from objective function. |
| |
| Keywords: | Pure Integer Linear Programming Objective Function Simplex Method Dual Simplex Method |
| 本文献已被 CNKI 等数据库收录！ |
