Dynamic programming is applied to the economic dispatch problem with spin- ning reserve constraint. A first algorithm, based on a direct application of Bellman’s equation with two state variables turns out to be slow for large systems. A second algorithm exploiting state dominance is much more efficient. Computational results are presented. Moreover, we show that well-known heuristic approaches do not provide optimal solutions even for small systems.