【摘要】 对于线性规划的 Karmarkar-Todd-Burrell-Gay 算法[2],本文重新证明了它的收敛性,此外,我们还提出了一种计算初值的实用途径,并对步长的一维搜索方法进行了初步的分析。最后,我们用几种典型例题检验了该算法的实际效果。更多还原

【Abstract】 For Karmarkar-Todd-Burrell-Gay algorithm[2]of linear programm- ing,we re-Proved its convergence results.In addition,we raised a Practical approach to compute initial values in this paper,and discu- ssed briefly about line search for obtaining optimal staplength.At la- st,the algorithm works,we used several standard examples to test the numerical results.更多还原