Linear programming formulation for non-stationary, finite-horizon Markov decision process models
Linear programming (LP) formulations are often employed to solve stationary, infinite-horizon Markov decision process (MDP) models. We present an LP approach to solving non-stationary, finite-horizon MDP models that can potentially overcome the computational challenges of standard MDP solution proce...
Saved in:
Published in | Operations research letters Vol. 45; no. 6; pp. 570 - 574 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Elsevier B.V
01.11.2017
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!