论文部分内容阅读
The simplex method for linear programming(LP)is not known to be a polynomial or strongly polynomial algorithm,even if an LP problem is non-degenerate and its coefficient matrix is totally unimodular.