Network Revenue Management with Independent Demands

  • Guillermo Gallego
  • Huseyin Topaloglu
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 279)


In this chapter, we consider a firm that has finite capacities of several resources that can be instantly combined into different products with fixed prices. We assume that there is an independent demand stream for each of the products that arrives as a Poisson process. A requested product is purchased if available. The firm generates the revenue associated with the sale and updates the inventories of the resources consumed by the product. If the requested product is not available, then the customer leaves the system without purchasing. The objective of the firm is to decide which products to make available over a finite sales horizon to maximize the total expected revenue from fixed initial inventories that cannot be replenished during the sales horizon.


  1. D. Adelman, Dynamic bid-prices in revenue management. Oper. Res. 55 (4), 647–661 (2007)CrossRefGoogle Scholar
  2. M. Akan, B. Ata, Bid-price controls for network revenue management: martingale characterization of optimal bid prices. Math. Oper. Res. 64 (4), 912–936 (2009)CrossRefGoogle Scholar
  3. K. Amaruchkul, W.L. Cooper, D. Gupta, Single-leg air-cargo revenue management. Transp. Sci. 41 (4), 457–469 (2007)CrossRefGoogle Scholar
  4. K. Amaruchkul, W.L. Cooper, D. Gupta, A note on air-cargo capacity contracts. Prod. Oper. Manag. 20 (1), 152–162 (2011)CrossRefGoogle Scholar
  5. B. Ata, M. Akan, On bid-price controls for network revenue management. Stoch. Syst. 5 (2), 268–323 (2015)CrossRefGoogle Scholar
  6. C. Barz, D. Adelman, C. Uckun, Power approximations for network revenue management, in 26th European Conference on Operational Research (2013)Google Scholar
  7. A. Bassamboo, S. Kumar, R.S. Randhawa, Dynamics of new product introduction in closed rental systems. Oper. Res. 57 (6), 1347–1359 (2009)CrossRefGoogle Scholar
  8. D. Bertsimas, S. de Boer, Simulation-based booking limits for airline revenue management. Oper. Res. 53 (1), 90–106 (2005)CrossRefGoogle Scholar
  9. D. Bertsimas, I. Popescu, Revenue management in a dynamic network environment. Transp. Sci. 37 (3), 257–277 (2003)CrossRefGoogle Scholar
  10. D. Bertsimas, R. Shioda, Restaurant revenue management. Oper. Res. 51 (3), 472–486 (2003)CrossRefGoogle Scholar
  11. A. Calmon, D.F. Ciocan, G. Romero, Revenue management with repeated customer interactions. Technical report, University of Toronto, Toronto, ON (2019)Google Scholar
  12. Y. Chen, R. Levi, C. Shi, Revenue management of reusable resources with advanced reservations. Prod. Oper. Manag. 26 (5), 836–859 (2017c)CrossRefGoogle Scholar
  13. D.F. Ciocan, V.F. Farias, Dynamic allocation problems with volatile demand. Math. Oper. Res. 37 (3), 501–525 (2012b)CrossRefGoogle Scholar
  14. W. Cooper, Asymptotic behavior of an allocation policy for revenue management. Oper. Res. 50 (4), 720–727 (2002)CrossRefGoogle Scholar
  15. W.L. Cooper, T. Homem de Mello, Some decomposition methods for revenue management. Transp. Sci. 41 (3), 332–353 (2007)CrossRefGoogle Scholar
  16. S.V. de Boer, R. Freling, N. Piersma, Mathematical programming for network revenue management revisited. Eur. J. Oper. Res. 137 (1), 72–92 (2002)CrossRefGoogle Scholar
  17. V.F. Farias, B. Van Roy, An approximate dynamic programming approach to network revenue management. Technical report, MIT, Cambridge, MA (2007)Google Scholar
  18. B. Feng, Y. Li, Z.-J.M. Shen, Air cargo operations: literature review and comparison with practices. Transp. Res. C Emerg. Technol. 56 (July), 263–280 (2015)CrossRefGoogle Scholar
  19. G. Gallego, A min-max distribution-free procedure for the (Q, r) inventory model. Oper. Res. Lett. 11 (1), 55–60 (1992)CrossRefGoogle Scholar
  20. G. Gallego, C. Stefanescu, Upgrades, upsells and pricing in revenue management. Technical report, Columbia University, New York, NY (2009)CrossRefGoogle Scholar
  21. G. Gallego, C. Stefanescu, Services engineering: design and pricing of service features, in The Oxford Handbook of Pricing Management, ed. by R. Phillips, Ö. Özer (Oxford University Press, Oxford, 2012), pp. 711–733Google Scholar
  22. X. Hu, R. Caldentey, G. Vulcano, Revenue sharing in airline alliances. Manag. Sci. 59 (5), 1177–1195 (2013b)CrossRefGoogle Scholar
  23. S. Jasin, Re-optimization and self-adjusting price control for network revenue management. Oper. Res. 62 (5), 1168–1178 (2014)CrossRefGoogle Scholar
  24. S. Jasin, Performance of an LP-based control for revenue management with unknown demand parameters. Oper. Res. 63 (4), 909–915 (2015)CrossRefGoogle Scholar
  25. S. Jasin, S. Kumar, Analysis of deterministic LP-based heuristics for network revenue management. Oper. Res. 61 (6), 1312–1320 (2013)CrossRefGoogle Scholar
  26. S.N. Kirshner, M. Nediak, Scalable dynamic bid prices for network revenue management in continuous time. Prod. Oper. Manag. 24 (10), 1621–1635 (2015)CrossRefGoogle Scholar
  27. S. Kunnumkal, K. Talluri, Technical note – a note on relaxations of the choice network revenue management dynamic program. Oper. Res. 64 (1), 158–166 (2016a)CrossRefGoogle Scholar
  28. S. Kunnumkal, K. Talluri, On a piecewise-linear approximation for network revenue management. Math. Oper. Res. 41 (1), 72–91 (2016b)CrossRefGoogle Scholar
  29. S. Kunnumkal, H. Topaloglu, Computing time-dependent bid prices in network revenue management problems. Transp. Sci. 44 (1), 38–62 (2010c)CrossRefGoogle Scholar
  30. Y. Lei, S. Jasin, Real-time dynamic pricing for revenue management with reusable resources, advance reservation, and deterministic service time requirements. Technical report, University of Michigan, Ann Arbour, MI (2018)Google Scholar
  31. R. Levi, A. Radovanovic, Provably near-optimal LP-based policies for revenue management of reusable resources. Oper. Res. 58 (2), 503–507 (2010)CrossRefGoogle Scholar
  32. Y. Levin, M. Nediak, H. Topaloglu, Cargo capacity management with allotments and spot market demand. Oper. Res. 60 (2), 351–365 (2012)CrossRefGoogle Scholar
  33. T. Levina, Y. Levin, J. McGill, M. Nediak, Network cargo capacity management. Oper. Res. 59 (4), 1008–1023 (2011)CrossRefGoogle Scholar
  34. W. Ma, D. Simchi-Levi, Online resource allocation under arbitrary arrivals: optimal algorithms and tight competitive ratios. Technical report, MIT, Cambridge, MA (2017)Google Scholar
  35. C. Maglaras, J. Meissner, Dynamic pricing strategies for multiproduct revenue management problems. Manuf. Serv. Oper. Manag. 8 (2), 135–148 (2006)CrossRefGoogle Scholar
  36. J. Meissner, A. Strauss, Network revenue management with inventory-sensitive bid prices and customer choice. Eur. J. Oper. Res. 216 (2), 459–468 (2012)CrossRefGoogle Scholar
  37. S. Netessine, R.A. Shumsky, Revenue management games: horizontal and vertical competition. Manag. Sci. 51 (5), 813–831 (2005)CrossRefGoogle Scholar
  38. Z. Pang, O. Berman, M. Hu, Up then down: bid-price trends in revenue management. Prod. Oper. Manag. 24 (7), 1135–1147 (2014)CrossRefGoogle Scholar
  39. G. Perakis, G. Roels, Robust controls for network revenue management. Manuf. Serv. Oper. Manag. 12 (1), 56–76 (2010)CrossRefGoogle Scholar
  40. M.I. Reiman, Q. Wang, An asymptotically optimal policy for a quantity-based network revenue management problem. Math. Oper. Res. 33 (2), 257–282 (2008)CrossRefGoogle Scholar
  41. G. Roels, K. Fridgeirsdottir, Dynamic revenue management for online display advertising. J. Revenue Pricing Manag. 8 (5), 452–466 (2009)CrossRefGoogle Scholar
  42. R. Shumsky, The Southwest effect, airline alliances and revenue management. J. Revenue Pricing Manag. 5 (1), 83–89 (2006)CrossRefGoogle Scholar
  43. R.A. Shumsky, F. Zhang, Dynamic capacity management with substitution. Oper. Res. 57 (3), 671–684 (2009)CrossRefGoogle Scholar
  44. C. Stein, V.A. Truong, X. Wang, Advance reservations with heterogeneous customers. Manag. Sci. (2019, forthcoming)Google Scholar
  45. K. Talluri, G. van Ryzin, An analysis of bid-price controls for network revenue management. Manag. Sci. 44 (11), 1577–1593 (1998)CrossRefGoogle Scholar
  46. K. Talluri, G. van Ryzin, A randomized linear programming method for computing network bid prices. Transp. Sci. 33 (2), 207–216 (1999)CrossRefGoogle Scholar
  47. K. Talluri, F. Castejon, B. Codina, J. Magaz, Proving the performance of a new revenue management system. J. Revenue Pricing Manag. 9 (4), 300–312 (2010)CrossRefGoogle Scholar
  48. C. Tong, H. Topaloglu, On approximate linear programming approaches for network revenue management problems. INFORMS J. Comput. 26 (1), 121–134 (2014)CrossRefGoogle Scholar
  49. H. Topaloglu, A stochastic approximation method to compute bid prices in network revenue management problems. INFORMS J. Comput. 20 (4), 596–610 (2008)CrossRefGoogle Scholar
  50. H. Topaloglu, On the asymptotic optimality of the randomized linear program for network revenue management. Eur. J. Oper. Res. 197 (3), 884–896 (2009a)CrossRefGoogle Scholar
  51. H. Topaloglu, Using Lagrangian relaxation to compute capacity-dependent bid prices in network revenue management. Oper. Res. 57 (3), 637–649 (2009b)CrossRefGoogle Scholar
  52. G.J. van Ryzin, G. Vulcano, Simulation-based optimization of virtual nesting controls for network revenue management. Oper. Res. 56 (4), 865–880 (2008a)CrossRefGoogle Scholar
  53. T. Vossen, D. Zhang, A dynamic disaggregation approach to approximate linear programs for network revenue management. Prod. Oper. Manag. 24 (3), 469–487 (2015)CrossRefGoogle Scholar
  54. X. Wang, V.A. Truong, D. Bank, Online advance admission scheduling for services with customer preferences. Technical report, Columbia University, New York, NY (2018)Google Scholar
  55. E.L. Williamson, Airline network seat inventory control: Methodologies and revenue impacts. PhD thesis, Flight Transportation Laboratory, Massachusetts Institute of Technology, Cambridge, MA, 1992Google Scholar
  56. C.P. Wright, H. Groenevelt, R.A. Shumsky, Dynamic revenue management in airline alliances. Transp. Sci. 44 (1), 15–37 (2010)CrossRefGoogle Scholar
  57. Y. Yu, X. Chen, F. Zhang, Dynamic capacity management with general upgrading. Oper. Res. 63 (6), 1372–1389 (2015)CrossRefGoogle Scholar
  58. D. Zhang, T. Vossen, Reductions of approximate linear programs for network revenue management. Oper. Res. 63 (6), 1352–1371 (2015)CrossRefGoogle Scholar
  59. H. Zhang, C. Shi, C. Qin, C. Hua, Stochastic regret minimization for revenue management problems with nonstationary demands. Nav. Res. Logist. 63 (6), 433–448 (2016)CrossRefGoogle Scholar
  60. W. Zhuang, M. Gumus, D. Zhang, A single-resource revenue management problem with random resource consumptions. J. Oper. Res. Soc. 63, 1213–1227 (2012)CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  • Guillermo Gallego
    • 1
  • Huseyin Topaloglu
    • 2
  1. 1.Clearwater BayHong Kong
  2. 2.ORIECornell UniversityNew YorkUSA

Personalised recommendations