In this paper we propose a modification of the finite termination algorithm which reduces the dimension of the primal-dual linear programming problem. We note that the similar approach is possible in any primal-dual algorithm for linear programming.