Abstract
Revenue management deals with selling a limited amount of a perishable resource. This resource becomes valueless at a known point of time (deadline). There are many papers dealing with one-dimensional resources (e. g. seats or hotel rooms) using different approaches as linear programming or Markov decision processes which consider the problem as a dynamic stochastic knapsack problem (DSKP).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Kleywegt A., Papastavrou J. (1998) The Dynamic and Stochastic Knapsack Problem. Operations Research 46, January/February, 17–35
Kleywegt A., Papastavrou J. (2001) The Dynamic and Stochastic Knapsack Problem with Random Sized Items. Operations Research 49, January/February, 26–41
McGill J., van Ryzin, G. (1999) Revenue Management: Research Overview and Prospects. Management Science 33, May, 233–256
van Sylke R., Young Y. (2000) Finite Horizon Stochastic Knapsacks with Applications to Yield Management. Operations Research 48, January/February, 155–172
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feller, J. (2003). Pricing of Multidimensional Resources in Revenue Management (Multidimensional Dynamic Stochastic Knapsack Problem). In: Leopold-Wildburger, U., Rendl, F., Wäscher, G. (eds) Operations Research Proceedings 2002. Operations Research Proceedings 2002, vol 2002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55537-4_66
Download citation
DOI: https://doi.org/10.1007/978-3-642-55537-4_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00387-8
Online ISBN: 978-3-642-55537-4
eBook Packages: Springer Book Archive