一阶段单纯形法

One--Phase Simplex Method

对求解标准线性规划的两阶段单纯形法作了推广,引入了次容许解、次判别数概念;所给出的算法从迭代一开始就对原目标函数进行优化,从而将单纯形法的两个阶段统一为一个阶段,故称为一阶段单纯形法。论证了这种算法的理论根据,并指出了这种算法与两阶段单纯形法相比所具有的优点。

With the concepts of secondary feasible solution and criterion numberintroduced in this paper, the two-phase simplex method is extended for thesolution of linear programming in standard form.In this way the original objec-tive function should be optimized from the very beginning in the process ofiteration, thus combined the two phases into one for the simplex method. Thealgorithm is discussed theoretically, and its advantages over the two--phasesimplex method are pointed out.