You are not currently logged in.
Access JSTOR through your library or other institution:
Revenue Management with Limited Demand Information
Yingjie Lan, Huina Gao, Michael O. Ball and Itir Karaesmen
Vol. 54, No. 9 (Sep., 2008), pp. 1594-1609
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/30219126
Page Count: 16
You can always find the topics here!Topics: Revenue, Mathematical sequences, Information management, Airlines, Management science, Optimal policy, Optimal solutions, Forecasting models, Discrete problems, Simulations
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
In this paper, we consider the classical multifare, single-resource (leg) problem in revenue management for the case where demand information is limited. Our approach employs a competitive analysis, which guarantees a certain performance level under all possible demand scenarios. The only information required about the demand for each fare class is lower and upper bounds. We consider both competitive ratio and absolute regret performance criteria. For both performance criteria, we derive the best possible static policies, which employ booking limits that remain constant throughout the booking horizon. The optimal policies have the form of nested booking limits. Dynamic policies, which employ booking limits that may be adjusted at any time based on the history of bookings, are also obtained. We provide extensive computational experiments and compare our methods to existing ones. The results of the experiments demonstrate the effectiveness of these new robust methods.
Management Science © 2008 INFORMS