摘要
提出了求解线性规划(LP)问题的一种新方法———筛选迭代算法。它通过筛选n维LP问题的n个控制约束方程(不添加松驰变量)
In this paper, we present a new algorithm for linear programming. According to this algorithm, the optimal solution can be found by screening—Iteration Method and no relaxation variable is needed.
出处
《运筹与管理》
CSCD
1999年第4期16-19,共4页
Operations Research and Management Science
关键词
线性规划
筛选法
迭代法
linear programming
screening method
iteration method
