保硬主元算法的数值报告

Numerical Reports of Hard Bound Algorithm

保硬主元算法是线性规划基线算法的一种很好的实现形式.在一张基线表格中可以同时实现原始可行和对偶可行.大量的数值实验表明保硬主元算法有稳健的收敛过程,与原始单纯形法相比,问题的规模越大,保硬主元算法的相对迭代次数越少。

Hard Bound Algorithm is one of Basic Line Algorithms for Linear Programming.In this paper,numerical reports show that it is more efficient than Simplex Method on Large scales.Comparing to Simplex Method,its iteration steps and time are both deduced Largely.