Newsvendor problems with sequentially revealed demand information

Jing‐Sheng Song and Paul H. Zipkin

Naval Research Logistics (NRL), 2012, vol. 59, issue 8, 601-612

Abstract: This article analyzes a capacity/inventory planning problem with a one‐time uncertain demand. There is a long procurement leadtime, but as some partial demand information is revealed, the firm is allowed to cancel some of the original capacity reservation at a certain fee or sell off some inventory at a lower price. The problem can be viewed as a generalization of the classic newsvendor problem and can be found in many applications. One key observation of the analysis is that the dynamic programming formulation of the problem is closely related to a recursion that arises in the study of a far more complex system, a series inventory system with stochastic demand over an infinite horizon. Using this equivalence, we characterize the optimal policy and assess the value of the additional demand information. We also extend the analysis to a richer model of information. Here, demand is driven by an underlying Markov process, representing economic conditions, weather, market competition, and other environmental factors. Interestingly, under this more general model, the connection to the series inventory system is different. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 2012

Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
https://doi.org/10.1002/nav.21509

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:59:y:2012:i:8:p:601-612

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().