摘要
通过分析退化基本可行解与取零值检验数的关系,探讨退化最优解的一些特征.得到了判断线性规划问题具有唯一退化最优解的充分条件,以及某些常见情形下的充要条件.
Through analyzing the relationship of basic feasible solutions and check numbers,this paper explores the characteristics of the degenerate optimal solutions. The sufficient condition for a linear programming problem which has the unique degenerate optimal solution is given. Meanwhile this paper gives the necessary and sufficient conditions in some common situations.
出处
《泰山学院学报》
2016年第3期30-33,共4页
Journal of Taishan University
关键词
线性规划
单纯形法
最优解
linear programming
simplex method
optimal solution