Linear Programming Approximations for Markov Control Processes in Metric Spaces

We develop a general framework to analyze the convergence of linear-programming approximations for Markov control processes in metric spaces. The approximations are based on aggregation and relaxation of constraints, as well as inner approximations of the decision variables. In particular, conditions are given under which the control problems optimal value can be approximated by a sequence of finite-dimensional linear programs.