A modified dynamic programming method for markovian decision problems
Reads0
Chats0
TLDR
In this article, a modified dynamic programming method for the problem of choosing the action at the beginning of each period which will maximize future total discounted income is described, and the convergence appears to be quite rapid.About:
This article is published in Journal of Mathematical Analysis and Applications.The article was published on 1966-04-01 and is currently open access. It has received 147 citations till now. The article focuses on the topics: Monotone polygon & Decision problem.read more
Citations
More filters
OtherDOI
Markov Decision Processes
TL;DR: The Markov Decision Process (MDP) as mentioned in this paper is an optimization model of discrete-stage, sequential decision making in a stochastic environment, called the Markov decision process.
Book ChapterDOI
Computational advances in dynamic programming
TL;DR: A guided tour of the literature on computational methods in dynamic programming focusing on discrete deterministic finite (stage or horizon) dynamic programs.
Journal ArticleDOI
A Heuristic Search Approach for a Nonstationary Stochastic Shortest Path Problem with Terminal Cost
James L. Bander,Chelsea C. White +1 more
TL;DR: A best-first heuristic search approach for determining an optimal policy for a stochastic shortest path problem, and demonstrates the significant computational advantages of AO *, relative to dynamic programming, on the basis of run time and storage.
Journal ArticleDOI
Approximation and bounds in discrete event dynamic programming
Alain Haurie,Pierre L'Ecuyer +1 more
TL;DR: In this article, a general dynamic programming algorithm for the solution of optimal stochastic control problems concerning a class of discrete event systems is presented, where the emphasis is put on the numerical technique used for the approximation of the dynamic programming equation.
Journal ArticleDOI
The Fixed-Charge Perishable Inventory Problem
TL;DR: This paper deals with the problem of determing both optimal and approximate ordering policies for a fixed-life perishable commodity when there is a fixed charge or set-up cost for placing an order.
References
More filters
Book
Dynamic Programming
TL;DR: The more the authors study the information processing aspects of the mind, the more perplexed and impressed they become, and it will be a very long time before they understand these processes sufficiently to reproduce them.
Journal ArticleDOI
Linear Programming and Sequential Decisions
TL;DR: In this paper, a typical sequential probabilistic model may be formulated in terms of a an initial decision rule and b a Markov process, and then optimized by means of linear programming.