Newsvendor problems with sequentially revealed demand information

Published

Journal Article

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 Copyright © 2012 Wiley Periodicals, Inc.

Full Text

Duke Authors

Cited Authors

  • Song, JS; Zipkin, PH

Published Date

  • January 1, 2012

Published In

Volume / Issue

  • 59 / 8

Start / End Page

  • 601 - 612

Electronic International Standard Serial Number (EISSN)

  • 1520-6750

International Standard Serial Number (ISSN)

  • 0894-069X

Digital Object Identifier (DOI)

  • 10.1002/nav.21509

Citation Source

  • Scopus