K. G. Murty and Y. Fathi, “A Feasible Direction Method for Linear Programming,” Operations Research Letters, Vol. 3, No. 3, 1984, pp. 121-127. doi:10.1016/0167-6377(84)90003-8

has been cited by the following article:

• TITLE: A Modified Centered Climbing Algorithm for Linear Programming

  AUTHORS: Ming-Fang Ding, Yanqun Liu, John Anthony Gear

  KEYWORDS: Linear Programming; Ladder Method; Climbing Rules; Simplex Method

  JOURNAL NAME: Applied Mathematics, Vol.3 No.10A, November 1, 2012

  ABSTRACT: In this paper, we propose a modified centered climbing algorithm (MCCA) for linear programs, which improves the centered climbing algorithm (CCA) developed for linear programs recently. MCCA implements a specific climbing scheme where a violated constraint is probed by means of the centered vector used by CCA. Computational comparison is made with CCA and the simplex method. Numerical tests show that, on average CPU time, MCCA runs faster than both CCA and the simplex method in terms of tested problems. In addition, a simple initialization technique is introduced.