Now suppose that is continuous, in addition to . Assume that is both a closed and bounded subset of . Once again, the dynamic programming recurrence, (8.56), remains the same. The trouble now is that the represents an optimization problem over an uncountably infinite number of choices. One possibility is to employ nonlinear optimization techniques to select the optimal . The effectiveness of this depends heavily on , , and the cost functional.
Another approach is to evaluate (8.56) over a finite set of samples drawn from . Again, it is best to choose samples that reduce the dispersion as much as possible. In some contexts, it may be possible to eliminate some actions from consideration by carefully utilizing the properties of the cost-to-go function and its representation via interpolation.