Evolutionary programming as a solution technique for the Bellman equation

Evolutionary programming is a stochastic optimization procedure that has proved useful in optimizing difficult functions. This paper shows that evolutionary programming can be used to solve the Bellman equation problem with a high degree of accuracy and substantially less CPU time than Bellman equation iteration. Future applications will focus on sometimes binding constraints, a class of problem for which standard solutions techniques are not applicable.