Primal-Interior Dual-Simplex Method and Dual-Interior Primal-Simplex Method In the General bounded Linear Programming

일반한계 선형계획법에서의 원내부점-쌍대단체법과 쌍대내부점-원단체법

In this paper, Primal-Interior Dual-Simplex method(PIDS) and Dual-Interior Primal-Simplex method(DIPS) are developed for the general bounded linear programming. Two methods were implemented and compared with other pricing techniques for the Netlib. linear programming problems. For the PIDS, it shows superior performance to both most nagative rule and dual steepest-edge method since it practically reduces degenerate iterations and has property to reduce the problem. For the DIPS, pt requires less iterations and computational time than least reduced cost method. but it shows inferior performance to the dynamic primal steepest-edge method.