Linear Programming Approximations for Markov Control Processes in Metric Spaces*

    loading  Checking for direct PDF access through Ovid

Abstract

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 problem's optimal value can be approximated by a sequence of finite-dimensional linear programs.

Related Topics

    loading  Loading Related Articles