关于<用初等行变换解一类线性规划问题>一文的注记

本指出，在献[1]提出的求解线性规划的方法中，对于初始可行基、最优解和零解的存在性问题所得出的某些结论是错误的，特殊是如果含n个变量的约束条件的增广矩阵经初等行变换后，其中某行的前n个分量非正，而最后一个分量为0时，应认为该线性规划问题可能有非零解，且不一定存在零解，而非[1]所述的结论。

Notes on Solving a Class of Linear Programming Problems by the Elementary Row Transformation

The paper points out that some conclusions about the existence of initial feasible solution,optimized solution and zero solution are wrong in the solution of linear programming proposed by.In particular if augmented matrix containing constrained conditions of n varibles through elementary row transformation, in which the first n's number is nonpositive and the last number is zero in certain equation, then the linear programming problems can have nonzero solution,and not necessarily zero solution given by.