Robust assortment optimization in revenue management under the multinomial logit choice model

Operations Research

Volumn 60, Issue 4, 2012, Pages 865-882

  Rusmevichientong, Paat ^a   Topaloglu, Huseyin ^b  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b Cornell University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASSORTMENT OPTIMIZATION; CHOICE MODEL; DECISION MAKERS; EXPECTED REVENUE; LOGIT MODELS; MULTINOMIAL LOGIT; NUMERICAL EXPERIMENTS; OPTIMAL POLICIES; PARAMETER VALUES; PERFORMANCE MEASURE; REVENUE MANAGEMENT; ROBUST APPROACHES; ROBUST FORMULATIONS; STATIC AND DYNAMIC; WORST CASE SCENARIO; WORST-CASE PERFORMANCE;

COMMERCE; OPTIMIZATION;

RAILROAD TRANSPORTATION;

EID: 84866415192     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1120.1063     Document Type: Article

References (37)

1. Anderson S, de Palma A, Thisse JF (1992) Discrete Choice Theory of Product Differentiation (MIT Press, Cambridge, MA).
2. Ben-Akiva M, Lerman SR (1985) Discrete Choice Analysis: Theory and Application to Travel Demand (MIT Press, Cambridge, MA).
3. Ben-Tal A, Nemirovski A (1999) Robust solutions of uncertain linear programs. Oper. Res. Lett. 25(1):1-13.
4. Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math. Programming 98(1):49-71.
5. Bertsimas D, Sim M (2004) The price of robustness. Oper. Res. 52(1):35-53. (Pubitemid 40000812)
6. Bertsimas D, Pachamanovab D, Sim M (2004) Robust linear optimization under general norms. Oper. Res. Lett. 32(6):510-516.
7. Birbil SI, Frank JBG, Gromicho JAS, Zhang S (2009) The role of robust optimization in single-leg airline revenue management. Management Sci. 55(1):148-163.
8. Boyd S, Vandenberghe L (2004) Convex Optimization (Cambridge University Press, Cambridge, UK).
9. Bront JM, Mendez Diaz I, Vulcano G (2009) A column generation algorithm for choice-based network revenue management. Oper. Res. 57(3):769-784.
10. Chaneton J, Vulcano G (2011) Computing bid-prices for revenue management under customer choice behavior. Manufacturing Service Oper. Management 13(4):452-470.
11. Farias VF, Jagabathula S, Shah D (2012) A non-parametric approach to modeling choice with limited data. Management Sci. Forthcoming.
12. Gallego G, Iyengar G, Phillips R, Dubey A (2004) Managing flexible products on a network. Working paper, Columbia University, New York.
13. Iyengar GN (2005) Robust dynamic programming. Math. Oper. Res. 30(2):257-280. (Pubitemid 43126832)
14. Kok AG, Fisher M, Vaidyanathan R (2008) Assortment planning: Review of literature and industry practice. Retail Supply Chain Management (Springer, New York).
15. Kunnumkal S, Topaloglu H (2008) A refined deterministic linear program for the network revenue management problem with customer choice behavior. Naval Res. Logist. 55(6):563-580.
16. Kunnumkal S, Topaloglu H (2010) A new dynamic programming decomposition method for the network revenue management problem with customer choice behavior. Production Oper. Management 19(5):575-590.
17. Liu Q, van Ryzin GJ (2008a) On the choice-based linear programming model for network revenue management. Manufacturing Service Oper. Management 10(2):288-310.
18. Liu Q, van Ryzin GJ (2008b) Strategic capacity rationing to induce early purchases. Management Sci. 54(6):1115-1131.
19. Megiddo N (1979) Combinatorial optimization with rational objective functions. Math. Oper. Res. 4(4):414-424.
20. Meissner J, Strauss AK (2012a) Improved bid prices for choice-based network revenue management. Eur. J. Oper. Res. 217(2):417-427.
21. Meissner J, Strauss AK (2012b) Network revenue management with inventory-sensitive bid prices and customer choice. Eur. J. Oper. Res. 216(2):459-468.
22. Mendez-Diaz I, Miranda Bront J, Vulcano G, Zabala P (2012) A branchand- cut algorithm for the latent-class logit assortment problem. Discrete Appl. Math. Forthcoming.
23. Perakis G, Roels G (2010) Robust controls for network revenue management. Manufacturing Service Oper. Management 12(1):56-76.
24. Phillips R (2011) Efficient frontiers in revenue management. INFORMS Revenue Management and Pricing Sect. Conf., New York (INFORMS, Hanover, MD).
25. Rusmevichientong P, Shen Z-JM, Shmoys DB (2010a) Dynamic assortment optimization with a multinomial logit choice model and capacity constraint. Oper. Res. 58(6):1666-1680.
26. Rusmevichientong P, Shmoys DB, Topaloglu H (2010b) Assortment optimization with mixtures of logits. Working paper, Cornell University, Ithaca, NY.
27. Ruszczyński A (2006) Nonlinear Optimization (Princeton University Press, Princeton, NJ).
28. Su X (2007) Intertemporal pricing with strategic customer behavior. Management Sci. 53(5):726-741. (Pubitemid 351159635)
29. Su X (2010) Intertemporal pricing and consumer stockpiling. Oper. Res. 58(4):1133-1147.
30. Talluri K (2010) A randomized concave programming method for choice network revenue management. Working paper, Universitat Pompeu Fabra, Barcelona, Spain.
31. Talluri K, van Ryzin GJ (2004) Revenue management under a general discrete choice model of consumer behavior. Management Sci. 50(1):15-33.
32. van Ryzin GJ, Mahajan S (1999) On the relationship between inventory costs and variety benefits in retail assortments. Management Sci. 45(11):1496-1509. (Pubitemid 30523642)
33. van Ryzin GJ, Vulcano G (2008) Computing virtual nesting controls for network revenue management under customer choice behavior. Manufacturing Service Oper. Management 10(3):448-467.
34. Vulcano G, van Ryzin GJ, Chaar W (2010) Choice-based revenue management: An empirical study of estimation and optimization. Manufacturing Service Oper. Management 12(3):371-392.
35. Vulcano G, van Ryzin GJ, Ratliff R (2012) Estimating primary demand for substitutable products from sales transaction data. Oper. Res. 60(2):313-334.
36. Zhang D (2011) An improved dynamic programming decomposition approach for network revenue management. Manufacturing Service Oper. Management 13(1):35-52.
37. Zhang D, Adelman D (2009) An approximate dynamic programming approach to network revenue management with customer choice. Transportation Sci. 43(3):381-394.