Capturing the set of algorithms as a linear polytope holds the following immediate advantages: • Computing the optimal algorithm reduces to solving a linear program. • Proving an upper bound on the ...

We present a novel linear program for the approximation of the dynamic programming cost-to-go function in high-dimensional stochastic control problems. LP approaches to approximate DP have typically ...