Technical Note - Complementary Slackness Theorem in Multiple Objective Linear Programming. - Soondal Park (Oper. Res., 1982)

An e-sensitivity analysis in the primal-dual interior point method. - Woo-Je Kim; Chan-Kyoo Park; Soondal Park (Eur. J. Oper. Res., 1999)

Shortest paths in a network with time-dependent flow speeds. - Kiseok Sung; Michael G. H. Bell; Myeongki Seong; Soondal Park (Eur. J. Oper. Res., 2000)

Solving linear systems in interior-point methods. - Tongryeol Seol; Soondal Park (Comput. Oper. Res., 2002)

LPAKO: A Simplex-based Linear Programming Program. - Sungmook Lim; Soondal Park (Optim. Methods Softw., 2002)

A New Admissible Pivot Method for Linear Programming. - Sungmook Lim; Soondal Park (Asia Pac. J. Oper. Res., 2004)

Positive sensitivity Analysis in Linear Programming. - Chan-Kyoo Park; Woo-Je Kim; Sangwook Lee; Soondal Park (Asia Pac. J. Oper. Res., 2004)

A label-setting algorithm for finding a quickest path. - Chan-Kyoo Park; Sangwook Lee; Soondal Park (Comput. Oper. Res., 2004)

On the Properties of ∊-sensitivity Analysis for Linear Programming. - Chan-Kyoo Park; Woo-Je Kim; Soondal Park (Asia Pac. J. Oper. Res., 2005)

An epsilon-sensitivity analysis for semidefinite programming. - Sungmook Lim; Sangwook Lee; Soondal Park (Eur. J. Oper. Res., 2005)