Technical Note—Product-Based Approximate Linear Programs for Network Revenue Management

Published Online:https://doi.org/10.1287/opre.2022.2354

References

  • Adelman D (2007) Dynamic bid-prices in revenue management. Oper. Res. 55(4):647–661.LinkGoogle Scholar
  • Ben Amor H, Desrosiers J, Valério de Carvalho JM (2006) Dual-optimal inequalities for stabilized column generation. Oper. Res. 54(3):454–463.LinkGoogle Scholar
  • Berbeglia G, Garassino A, Vulcano G (2021) A comparative empirical study of discrete choice models in retail operations. Management Sci. 68(6):4005–4023.LinkGoogle Scholar
  • Bertsimas D, Dunn JW (2019) Machine Learning Under a Modern Optimization Lens (Dynamic Ideas LLC, Waltham, MA).Google Scholar
  • Besbes O, Zeevi A (2012) Blind network revenue management. Oper. Res. 60(6):1537–1550.LinkGoogle Scholar
  • Bezanson J, Edelman A, Karpinski S, Shah VB (2017) Julia: A fresh approach to numerical computing. SIAM Rev. 59(1):65–98.CrossrefGoogle Scholar
  • Brown DB, Smith JE (2014) Information relaxations, duality, and convex stochastic dynamic programs. Oper. Res. 62(6):1394–1415.LinkGoogle Scholar
  • Cooper WL (2002) Asymptotic behavior of an allocation policy for revenue management. Oper. Res. 50(4):720–727.LinkGoogle Scholar
  • de Farias DP, Van Roy B (2003) The linear programming approach to approximate dynamic programming. Oper. Res. 51(6):850–865.LinkGoogle Scholar
  • de Farias DP, Van Roy B (2004) On constraint sampling in the linear programming approach to approximate dynamic programming. Math. Oper. Res. 29(3):462–478.LinkGoogle Scholar
  • Dunning I, Huchette J, Lubin M (2017) JuMP: A modeling language for mathematical optimization. SIAM Rev. 59(2):295–320.CrossrefGoogle Scholar
  • Farias VF, Van Roy B (2007) An approximate dynamic programming approach to network revenue mangement. Working paper, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA.Google Scholar
  • Gallego G, Topaloglu H (2019) Revenue Management and Pricing Analytics, vol. 209 (Springer, New York).CrossrefGoogle Scholar
  • Gallego G, van Ryzin GJ (1997) A multiproduct dynamic pricing problem and its applications to network yield management. Oper. Res. 45(1):24–41.LinkGoogle Scholar
  • Gschwind T, Irnich S (2016) Dual inequalities for stabilized column generation revisited. INFORMS J. Comput. 28(1):175–194.LinkGoogle Scholar
  • Gurobi Optimization (2022) Gurobi optimizer reference manual.Google Scholar
  • Kunnumkal S, Talluri K (2016) On a piecewise-linear approximation for network revenue management. Math. Oper. Res. 41(1):72–91.LinkGoogle Scholar
  • Liu Q, van Ryzin G (2008) On the choice-based linear programming model for network revenue management. Manufacturing Service Oper. Management 10(2):288–310.LinkGoogle Scholar
  • Ma Y, Rusmevichientong P, Sumida M, Topaloglu H (2020) An approximation algorithm for network revenue management under nonstationary arrivals. Oper. Res. 68(3):834–855.LinkGoogle Scholar
  • Meissner J, Strauss AK (2012) Network revenue management with inventory-sensitive bid prices and customer choice. Eur. J. Oper. Res. 216(2):459–468.CrossrefGoogle Scholar
  • Nadarajah S, Secomandi N (2020) Least squares Monte Carlo and approximate linear programming: Error bounds and energy real option application. Now Publishers 14(1–2):178–202.Google Scholar
  • Nadarajah S, Margot F, Secomandi N (2015) Relaxations of approximate linear programs for the real option management of commodity storage. Management Sci. 61(12):3054–3076.LinkGoogle Scholar
  • Talluri K, van Ryzin GJ (1998) An analysis of bid-price controls for network revenue management. Management Sci. 44(11):1577–1593.LinkGoogle Scholar
  • Talluri K, van Ryzin GJ (2004) The Theory and Practice of Revenue Management (Springer, New York).CrossrefGoogle Scholar
  • Tong C, Topaloglu H (2014) On the approximate linear programming approach for network revenue management problems. INFORMS J. Comput. 26(1):121–134.LinkGoogle Scholar
  • Topaloglu H (2009) Using Lagrangian relaxation to compute capacity-dependent bid prices in network revenue management. Oper. Res. 57(3):637–649.LinkGoogle Scholar
  • Topaloglu H, Powell WB (2006) Dynamic-programming approximations for stochastic time-staged integer multicommodity-flow problems. INFORMS J. Comput. 18(1):31–42.LinkGoogle Scholar
  • Van Ryzin G (2005) Future of revenue management. J. Revenue Pricing Management 4(2):204–210.CrossrefGoogle Scholar
  • Vossen T, Zhang D (2015a) A dynamic disaggregation approach to approximate linear programs for network revenue management. Production Oper. Management 24(3):488–503.CrossrefGoogle Scholar
  • Vossen T, Zhang D (2015b) Reductions of approximate linear programs for network revenue management. Oper. Res. 63(6):1352–1371.LinkGoogle Scholar
  • Vulcano G, van Ryzin G, Chaar W (2010) Choice-based revenue management: An empirical study of estimation and optimization. Manufacturing Service Oper. Management 12(3):371–392.LinkGoogle Scholar
  • Williamson E (1992) Airline network seat control. Unpublished PhD thesis, Massachusetts Institute of Technology, Cambridge, MA.Google Scholar
  • Zhang D, Adelman D (2009) An approximate dynamic programming approach to network revenue management with customer choice. Transportation Sci. 43(3):381–394.LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.