An Infinite-Dimensional Linear Programming Algorithm for Deterministic Semi-Markov Decision Processes on Borel Spaces

Authors:
Diego Klabjan;Daniel Adelman
Affiliations:
Department of Civil and Environmental Engineering, University of Illinois at Urbana-Champaign, 205 North Matthews Avenue, Urbana, Illinois 61801;Graduate School of Business, University of Chicago, 5801 South Woodlawn Avenue, Chicago, Illinois 60637
Venue:
Mathematics of Operations Research
Year:
2007

Citing 0
Cited 2

Feature Article---Merging AI and OR to Solve High-Dimensional Stochastic Optimization Problems Using Approximate Dynamic Programming

INFORMS Journal on Computing
A Shadow Simplex Method for Infinite Linear Programs

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We devise an algorithm for solving the infinite-dimensional linear programs that arise from general deterministic semi-Markov decision processes on Borel spaces. The algorithm constructs a sequence of approximate primal-dual solutions that converge to an optimal one. The innovative idea is to approximate the dual solution with continuous piecewise linear ridge functions that naturally represent functions defined on a high-dimensional domain as linear combinations of functions defined on only a single dimension. This approximation gives rise to a primal/dual pair of semi-infinite programs, for which we show strong duality. In addition, we prove various properties of the underlying ridge functions.