摘要
提出了一种无需引入人工变量,求取线性规划问题初始基可行解的直接算法,并给出了该方法的实算例子。
This paper presents a direct method for seeking primal feasible basic of linear programming problem without introducing ardficial variable. Several examples of the algorithm are given in the last section of paper.
出处
《华北科技学院学报》
2007年第2期95-96,共2页
Journal of North China Institute of Science and Technology
关键词
线性规划
两阶段法
人工变量
初始基可行解
linear programming
two-stage way
artificial variable
initial basic feasible solution