一类线性规划问题的快速解法——迭代单纯形算法

A Ouick Algorithm for Solving of a certain Linear Programming——Iterative Simplex Algorithm

本文针对一类线性规划问题(约束方程数与变量数差别较大)的特点,提出一种快速解法——迭代单纯形算法。大量数值实例表明,该算法的计算效率较普通单纯形法成倍提高。

A quick algorithm(Iterative Simplex Algorithm)is presened in this paper to solve a special kind of linear programming, in which the numbers of variables and constraint equations are quite different. The numerical examples show that the calculation speed of Iterative Simplex Algorithm is several times faster than that of general Simplex Algorithm.