We generalize an algorithm by van der Wal [6] for successive approximation of optimal strategies in non-discounted decision processes. This generalization is characterized as a method of strategy-improving, where the explicit solution of an equality system is not necessary. Several examples have demonstrated that the given method is advantageous in the case of decision spaces with high dimension especially.