关于Kallio-Porteus的一类线性规划算法的推广

Generalization of Kallio-Porteus’Methods for Iinear Programming

将Kallio和Porteus提出的求解线性规划的一类算法加以推广,进一步将其假设条件减弱,在非退化的情形下证明了算法的有限收敛性.

In this paper, we generalize the class of methods for linear programming proposed by Kallio and Porteus. Further, we weaken the assumption made by Kallio and Porteus and prove the finite convergence in the nondegenerate case.