On the Strength of Relaxations of Weakly Coupled Stochastic Dynamic Programs

Abstract

Many stochastic dynamic programs (DPs) have a weakly coupled structure in that a set of linking constraints in each period couple an otherwise independent collection of subproblems. Two widely studied approximations of such problems are approximate linear programs (ALP), which involve optimizing value function approximations that additively separate across subproblems, and Lagrangian relaxations, which involve relaxing the linking constraints. It is well-known that both of these approximations provide upper bounds on the optimal value function in all states and that the ALP provides a tighter upper bound in the initial state. The purpose of this short paper is to provide theoretical justification for the fact that these upper bounds are often close if not identical. We show: (i) For any weakly coupled DP, the difference between these two upper bounds --- the relaxation gap --- is bounded from above in terms of the integrality gap of the constraint separation problems within the ALP; (ii) If subproblem rewards are uniformly bounded and some broadly applicable conditions on the linking constraints hold, the relaxation gap is bounded from above by a constant that is independent of the number of subproblems; and (iii) When subproblem actions are binary and the linking constraints have a unimodular structure, the relaxation gap equals zero. The conditions for (iii) hold in several widely studied problems: restless bandit problems, online stochastic matching problems, network revenue management problems, and price-directed control of relocating resources. These findings generalize and unify existing results.