A Study of stability for solution′s convergence in Karmarkar's & Primal-Dual Interior Algorithm

Karmarkar's & Primal-Dual 내부점 알고리즘의 해의 수렴과정의 안정성에 관한 고찰

The researches of Linear Programming are Khachiyan Method, which uses Ellipsoid Method, and Karmarkar, Affine, Path-Following and Interior Point Method which have Polynomial-Time complexity. In this study, Karmarkar Method is more quickly solved as 50 times then Simplex Method for optimal solution. but some special problem is not solved by Karmarkar Method. As a result, the algorithm by APL Language is proved time efficiency and optimal solution in the Primal-Dual interior point algorithm. Furthermore Karmarkar Method and Primal-Dual interior point Method is compared in some examples.