The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A Probabilistic Production and Inventory Problem
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Cited by
Reinforcement Learning: A Survey
Kaelbling, L. P., Littman, M. L., & Moore, A. W. (1996) · Journal of Artificial Intelligence Research · doi:10.1613/jair.301 · Cited by 8,972
Constrained Markov Decision Processes: Stochastic Modeling
Altman, E. (2021) · Routledge eBooks · doi:10.1201/9781315140223 · Cited by 1,693
Decision-Theoretic Planning: Structural Assumptions and Computational Leverage
Boutilier, C., Dean, T., & Hanks, S. (1999) · Journal of Artificial Intelligence Research · doi:10.1613/jair.575 · Cited by 1,074
The Linear Programming Approach to Approximate Dynamic Programming
de Farias, D. P., & Van Roy, B. (2003) · Operations Research · doi:10.1287/opre.51.6.850.24925 · Cited by 687
On the Complexity of Solving Markov Decision Problems
Littman, M. L., Dean, T., & Kaelbling, L. P. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.4971 · Cited by 424
Metadata
- Authors
- d'Epenoux, F.
- Venue
- Management Science
- Published
- 1963-10
- Volume
- 10
- Issue
- 1
- Pages
- 98-108
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W2134293360
- Cited by
- 201
- References
- 1
- FWCI
- 9.62
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Probabilistic Production and Inventory Problem. https://app.cochat.ai/papers/10.1287/mnsc.10.1.98
- The paper
- d'Epenoux, F. (1963). A Probabilistic Production and Inventory Problem. Management Science. https://doi.org/10.1287/mnsc.10.1.98
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.