一个新的单纯形类算法

提出了一个求解线性规划的新单纯形类算法。它不仅无须引入人工变量，而且在第一阶段中采用无比检验。因此新算法比Arsham最近提出的push-to—pull算法效率更高。此外，本算法的数值稳定性也优于push—to—pull算法。

A New Simplex-like Algorithm for Liner Programming

In this paper,we introduce a new simplex-like algorithm for linear progranming.It is not only artificial-free,but also ratio-test-free in the first phase.Thus ,it needs fewer computation time per iteration than push-to-pull method proposed recently by Arshan.Furthermore,the new algorithm possesses better numerical stability.Computational experiments are reported,which are very encouraging though still preliminary.