摘要
给出了纯整数规划问题的一种异于传统方法的解法。其特点是引进的线性约束条件是从目标函数中产生的。
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.
出处
《西北民族大学学报（自然科学版）》
1998年第1期79-81,共3页
Journal of Northwest Minzu University(Natural Science)
关键词
纯整数规划
目标函数
单纯形法
对偶单纯形法
Pure Integer Linear Programming
Objective Function Simplex Method
Dual Simplex Method
