Solving a Dynamic Program by Linear Programming — General State and Action Spaces
- 85 Downloads
In the past two decades it has been shown by various authors that stochastic dynamic programming problems with finite state and action spaces and different notions of optimality can be solved by linear programming. In the present lecture it will bedemonstrated that dynamic programs with general state and action spaces can be treated by a generalized linear programming approach in the discounted reward case, in the average reward case, and in the optimal stopping case.
Unable to display preview. Download preview PDF.
- C. Derman. Finite State Markovian Decision Processes. Academic Press. New York 1970.Google Scholar
- W.-R. Heilmann. Solving a General Discounted Dynamic Program by Linear Programming, 1977. To be published.Google Scholar
- W.-R. Heilmann. Generalized Linear Programming in Markovian Decision Problems, 1977. To be published in Bonner Mathematische Schriften.Google Scholar
- W. Krabs. Optimierung und Approximation. Teubner-Verlag. Stuttgart 1975.Google Scholar