This paper deals with the optimal stopping problem for Markov chains with non-discounted total payment. Paper [2] proves a sufficient condition: The value function of the optimal stopping problem for discrete finite Markov chains exists if the corresponding linear programming has a solution. This paper also shows that this condition is also necessary.