Stochastic Knapsack Problem Revisited: Switch-Over Policies and Dynamic Pricing
AbstractThe stochastic knapsack has been used as a model in wide ranging applications from dynamic resource allocation to admission control in telecommunication. In recent years, a variation of the model has become a basic tool in studying problems that arise in revenue management and dynamic/flexible pricing; and it is in this context that our study is undertaken. Based on a dynamic programming formulation and associated properties of the value function, we study in this paper a class of control that we call switch-over policies -- start from accepting only orders of the highest price, and switch to including lower prices as time goes by, with the switch-over times optimally decided via convex programming. We establish the asymptotic optimality of the switch-over policy, and develop pricing models based on this policy to optimize the price reductions over the decision horizon.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by arXiv.org in its series Papers with number 0708.1146.
Date of creation: Aug 2007
Date of revision:
Contact details of provider:
Web page: http://arxiv.org/
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Youyi Feng & Guillermo Gallego, 2000. "Perishable Asset Revenue Management with Markovian Time Dependent Demand Intensities," Management Science, INFORMS, vol. 46(7), pages 941-956, July.
- Wen Zhao & Yu-Sheng Zheng, 2000. "Optimal Dynamic Pricing for Perishable Assets with Nonhomogeneous Demand," Management Science, INFORMS, vol. 46(3), pages 375-388, March.
- Jason D. Papastavrou & Srikanth Rajagopalan & Anton J. Kleywegt, 1996. "The Dynamic and Stochastic Knapsack Problem with Deadlines," Management Science, INFORMS, vol. 42(12), pages 1706-1718, December.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (arXiv administrators).
If references are entirely missing, you can add them using this form.