In this paper we present a dynamic optimal method for adjusting the centering pa-rameter in the wide-neighborhood primal-dual interior-point algorithms for linear pro-gramming, while the centering parameter is generally a constant in the classical wide-neighborhood primal-dual interior-point algorithms. The computational results show thatthe new method is more efficient.