线性规划问题有无穷多个最优解的判别方法

本文给出了如何用求线性规划的基本方法单纯形法判别线性规划问题有无穷多个最优解的方法，特别地给出了在线性规划问题最优基单纯形表中存在某个非基为量的检验数为零而且这和对应的列向量无正元素时，这种用单纯形法无法迭代是，无穷多个最优解的判别方法，并相应给出了如何从一个已知最优解，求出其它一些最优解的方法。

JUDGING METHOD OF INFINITY OPTIMIZATIONSOLUTIONS FOR LINEAR PROGRAMMING

In this paper, we made use of simplex method to judge infinity solutions of optimization for solving linear programming problem.In particular,a judgement method of infinity optimization solutions was given in optimization base simplex table of linear programming ,test number fbr some no - base variable was zero and the row vector of th corresponding was not positive element, which did not interation with simplex method. Method and example was given about a known solution of optimization to solve other solutions.