Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model
Authors:
- 1 August 2012
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 60 (4) , 865-882
Abstract
We study robust formulations of assortment optimization problems under the multinomial logit choice model. The novel aspect of our formulations is that the true parameters of the logit model are assumed to be unknown, and we represent the set of likely parameter values by a compact uncertainty set. The objective is to find an assortment that maximizes the worst-case expected revenue over all parameter values in the uncertainty set. We consider both static and dynamic settings. The static setting ignores inventory consideration, whereas in the dynamic setting, there is a limited initial inventory that must be allocated over time. We give a complete characterization of the optimal policy in both settings, show that it can be computed efficiently, and derive operational insights. We also propose a family of uncertainty sets that enables the decision maker to control the trade-off between increasing the average revenue and protecting against the worst-case scenario. Numerical experiments show that our robust approach, combined with our proposed family of uncertainty sets, is especially beneficial when there is significant uncertainty in the parameter values. When compared to other methods, our robust approach yields over 10% improvement in the worst-case performance, but it can also maintain comparable average revenue if average revenue is the performance measure of interest.Keywords
This publication has 31 references indexed in Scilit:
- Improved bid prices for choice-based network revenue managementEuropean Journal of Operational Research, 2012
- Network revenue management with inventory-sensitive bid prices and customer choiceEuropean Journal of Operational Research, 2012
- Computing Bid Prices for Revenue Management Under Customer Choice BehaviorManufacturing & Service Operations Management, 2011
- An Improved Dynamic Programming Decomposition Approach for Network Revenue ManagementManufacturing & Service Operations Management, 2011
- Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity ConstraintOperations Research, 2010
- A New Dynamic Programming Decomposition Method for the Network Revenue Management Problem with Customer Choice BehaviorProduction and Operations Management, 2010
- A refined deterministic linear program for the network revenue management problem with customer choice behaviorNaval Research Logistics (NRL), 2008
- Robust linear optimization under general normsOperations Research Letters, 2004
- Robust discrete optimization and network flowsMathematical Programming, 2003
- Robust solutions of uncertain linear programsOperations Research Letters, 1999