Multiple optimal solutions to the linearprogramming problem by the simplexmethod for specific feasible regions sometimes might lead to a loss of efficiency.
用单纯形法求解线性规划问题的多最优解，对一类特殊的可行域，有时会导致失效。
2
Based on the convex simplexmethod for nonlinear programming, a sensitivity analysis of consumption coefficient matrix in linear fractional programming is presented.
基于解非线形规划的凸单纯形法，对一类线形分式规划的消耗系数矩阵进行灵敏度分析。
3
To improve the methodof solving linearprogramming problem by means ofsimplexmethod, this paper gives the method oflinearprogramming problem general solution with infinite optimal solutions.