We devise an algorithm for solving the infinite-dimensional linear programs that arise from general deterministic semi-Markov decision processes on Borel spaces. The algorithm constructs a sequence of ...
A condition is derived that must be satisfied by a continuous function h: X → X in order to be the optimal policy function of a strictly concave deterministic dynamic programming problem which is ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback