Key points are not available for this paper at this time.
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.
Derman et al. (Thu,) studied this question.