Some Remarks on Finite Horizon Markovian Decision Models

Published Online:https://doi.org/10.1287/opre.13.2.272

It is shown that finite horizon Markovian decision problems can be handled as linear programming problems. Thus, problems with large numbers of side constraints, which would be difficult to treat by dynamic programming methods, can be handled by linear programming methods. Fixed and random horizon problems are discussed.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.