论文部分内容阅读
Zionts提出的求解线性规划问题的criss-cross算法实际是一阶段算法,不过与传统一阶段算法不同,它交替进行原始和对偶迭代,而产生的既可以是原始可行解,也可以是对偶可行解.为了提高计算效率,文章提出了一种采用无比值检验规则的新criss-crOss算法,基于新算法编制的一个稠密软件在对40个小问题进行的数值试验中,就迭代次数而言,以2.12的比率胜过了传统的两阶段算法.“,”The criss-cross algorithm for solving linear programming problems presented by Zionts is actually a phase-1 algorithm.Different from classical phase-1 algorithm,it perfoms primal and dual iterations alternately until a primal or a dual solution is reached.To improve computational efficiency,a new criss-cross algorithm based on the ratiot-test-free rule is proposed.In computational tests with 40 small problems.a code based on a dense implementation of the proposed algorithm outperformed the classical two-phase algorithm with the total iteration ratio 2.12.