Abstract
R. Howard (R. Howard.1960. Dynamic Programming and Markov Processes. John Wiley and Sons, Inc., New York.) and A. Manne (A. Manne. 1960. Linear programming and sequential decisions. Management Science, April.) have suggested two methods for optimizing average costs per unit time by means of a sequential decision rule. This rule gives order quantities as a function of initial stock levels, and is based upon the assumption of a Markov process which is both homogenous and discrete. The formulation does not include any restrictive hypothesis on the structure of costs. This paper presents a synthesis of both dynamic and linear programming methods applicable to the same kind of model for the case of time discounting.
Keywords
Markov decision processDiscountingDynamic programmingProbabilistic logicMathematical optimizationLinear programmingMarkov chainComputer scienceDiscrete time and continuous timeProduction (economics)Markov processMathematical economicsStochastic programmingMathematicsOperations researchEconomicsStatisticsArtificial intelligence
Related Publications
Contraction Mappings in the Theory Underlying Dynamic Programming
Next article Contraction Mappings in the Theory Underlying Dynamic ProgrammingEric V. DenardoEric V. Denardohttps://doi.org/10.1137/1009030PDFBibTexSections ToolsAdd to favorite...
Markov Decision Processes: Discrete Stochastic Dynamic Programming.
From the Publisher: The past decade has seen considerable theoretical and applied research on Markov decision processes, as well as the growing use of these models in ecology, ...
The optimal control of partially observable Markov processes
The report studies the control of a finite-state, discrete-time Markov process characterized by incomplete state observation. The process is viewed through a set of outputs such...
Using dynamic programming for solving variational problems in vision
Dynamic programming is discussed as an approach to solving variational problems in vision. Dynamic programming ensures global optimality of the solution, is numerically stable, ...
Constrained Markov Decision Processes
This report presents a unified approach for the study of constrained Markov decision processes with a countable state space and unbounded costs. We consider a single controller ...
Publication Info
- Year
- 1963
- Type
- article
- Volume
- 10
- Issue
- 1
- Pages
- 98-108
- Citations
- 200
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
200
OpenAlex
Cite This
F. d'Epenoux
(1963).
A Probabilistic Production and Inventory Problem.
Management Science
, 10
(1)
, 98-108.
https://doi.org/10.1287/mnsc.10.1.98
Identifiers
- DOI
- 10.1287/mnsc.10.1.98