Dynamic programming problem with dimension over 1000
Numerical Dynamic programming is always an approximation when any of the variables are continuous....

Depending on the structure of the problem, some people claim that you can apply linear programming techniques to approximate a solution. These guys MIT paper, claim that they have experiments that show that their linear reprogramming approximation is good enough.