摘要
给出了一种求解不等式约束型线性规划问题的算法，这种算法与现有的其它单纯形类算法相比，不但内存占用少．而且迭代次数少、运算速度快．
An algorithm that finds linear programming under inequality constraint is described. The algorithm can not only greatly save storages, but also obviously decreas the number of iteration and raise the speed of computation as compared with available simplex algoritms.
出处
《西北建筑工程学院学报（自然科学版）》
1997年第2期63-68,71,共7页
Journal of Northwestern Institute of Architectural Engineering
关键词
线性规划
松弛变量
人工变量
基本可行解
linear programming
slack variable
artificial variable
basic feasible solution
optimal solution
