Some Remarks on Finite Horizon Markovian Decision Models

Abstract

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.