摘要
文 [1][2 ]提出了求解线性规划问题的一种新方法——分解筛选法。文 [3]证明了文 [2 ]的命题 A是错误的。本文进一步证明 。
A decomposition-screening method is presented in . In this paper, it is proved by the example of which the decomposition-screening method for solving the LP problem is wrong.
出处
《运筹与管理》
CSCD
2001年第4期59-62,共4页
Operations Research and Management Science
关键词
线性规划
筛选法
最优基可行解
linear programming
screening method
optimal basic feasible solution
