IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v63y2015i4p909-915.html
   My bibliography  Save this article

Performance of an LP-Based Control for Revenue Management with Unknown Demand Parameters

Author

Listed:
  • Stefanus Jasin

    (Stephen M. Ross School of Business, University of Michigan, Ann Arbor, Michigan 48109)

Abstract

We consider a standard network revenue management (RM) problem and study the performance of a linear program (LP)-based control, the Probabilistic Allocation Control (PAC), in the presence of unknown demand parameters. We show that frequent re-optimizations of PAC without re-estimation suffice to shrink the asymptotic impact of estimation error on revenue loss. If, in addition to re-optimizations, we also frequently re-estimate the parameters, we prove that the performance of PAC in the unknown parameters setting is almost as good as the performance of PAC in the known parameters setting. Our numerical experiments show that PAC yields a revenue improvement of order 0.5%–1.5% relative to LP-based Booking Limit and Bid Price in most cases. Given the small margin in RM industries, such as the airline industry (about 2%), this level of improvement can easily translate into a significant increase in profit.

Suggested Citation

  • Stefanus Jasin, 2015. "Performance of an LP-Based Control for Revenue Management with Unknown Demand Parameters," Operations Research, INFORMS, vol. 63(4), pages 909-915, August.
    • Handle: RePEc:inm:oropre:v:63:y:2015:i:4:p:909-915
    DOI: 10.1287/opre.2015.1390
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2015.1390
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2015.1390?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Guillermo Gallego & Garrett van Ryzin, 1997. "A Multiproduct Dynamic Pricing Problem and Its Applications to Network Yield Management," Operations Research, INFORMS, vol. 45(1), pages 24-41, February.
    2. Martin I. Reiman & Qiong Wang, 2008. "An Asymptotically Optimal Policy for a Quantity-Based Network Revenue Management Problem," Mathematics of Operations Research, INFORMS, vol. 33(2), pages 257-282, May.
    3. Wen-Chyuan Chiang & Jason C.H. Chen & Xiaojing Xu, 2007. "An overview of research on revenue management: current issues and future research," International Journal of Revenue Management, Inderscience Enterprises Ltd, vol. 1(1), pages 97-128.
    4. Stefanus Jasin & Sunil Kumar, 2013. "Analysis of Deterministic LP-Based Booking Limit and Bid Price Controls for Revenue Management," Operations Research, INFORMS, vol. 61(6), pages 1312-1320, December.
    5. Dan Zhang & Daniel Adelman, 2009. "An Approximate Dynamic Programming Approach to Network Revenue Management with Customer Choice," Transportation Science, INFORMS, vol. 43(3), pages 381-394, August.
    6. Stefanus Jasin & Sunil Kumar, 2012. "A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice," Mathematics of Operations Research, INFORMS, vol. 37(2), pages 313-345, May.
    7. Dragos Florin Ciocan & Vivek Farias, 2012. "Model Predictive Control for Dynamic Resource Allocation," Mathematics of Operations Research, INFORMS, vol. 37(3), pages 501-525, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. An, Jaehyung & Mikhaylov, Alexey & Jung, Sang-Uk, 2021. "A Linear Programming approach for robust network revenue management in the airline industry," Journal of Air Transport Management, Elsevier, vol. 91(C).
    2. Catherine Cleophas & Daniel Kadatz & Sebastian Vock, 2017. "Resilient revenue management: a literature survey of recent theoretical advances," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 16(5), pages 483-498, October.
    3. Pornpawee Bumpensanti & He Wang, 2020. "A Re-Solving Heuristic with Uniformly Bounded Loss for Network Revenue Management," Management Science, INFORMS, vol. 66(7), pages 2993-3009, July.
    4. Qi (George) Chen & Stefanus Jasin & Izak Duenyas, 2019. "Nonparametric Self-Adjusting Control for Joint Learning and Optimization of Multiproduct Pricing with Finite Resource Capacity," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 601-631, May.
    5. Negin Gorlezaei & Patrick Jaillet & Zijie Zhou, 2022. "Online Resource Allocation with Samples," Papers 2210.04774, arXiv.org.
    6. Dawsen Hwang & Patrick Jaillet & Vahideh Manshadi, 2021. "Online Resource Allocation Under Partially Predictable Demand," Operations Research, INFORMS, vol. 69(3), pages 895-915, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Stefanus Jasin & Amitabh Sinha, 2015. "An LP-Based Correlated Rounding Scheme for Multi-Item Ecommerce Order Fulfillment," Operations Research, INFORMS, vol. 63(6), pages 1336-1351, December.
    2. Yanzhe (Murray) Lei & Stefanus Jasin & Amitabh Sinha, 2018. "Joint Dynamic Pricing and Order Fulfillment for E-commerce Retailers," Manufacturing & Service Operations Management, INFORMS, vol. 20(2), pages 269-284, May.
    3. Hyun-Soo Ahn & Stefanus Jasin & Philip Kaminsky & Yang Wang, 2018. "Analysis of Deterministic Control and Its Improvements for an Inventory Problem with Multiproduct Batch Differentiation," Operations Research, INFORMS, vol. 66(1), pages 58-78, 1-2.
    4. Qi (George) Chen & Stefanus Jasin & Izak Duenyas, 2016. "Real-Time Dynamic Pricing with Minimal and Flexible Price Adjustment," Management Science, INFORMS, vol. 62(8), pages 2437-2455, August.
    5. Stefanus Jasin, 2014. "Reoptimization and Self-Adjusting Price Control for Network Revenue Management," Operations Research, INFORMS, vol. 62(5), pages 1168-1178, October.
    6. Dragos Florin Ciocan & Vivek Farias, 2012. "Model Predictive Control for Dynamic Resource Allocation," Mathematics of Operations Research, INFORMS, vol. 37(3), pages 501-525, August.
    7. Pornpawee Bumpensanti & He Wang, 2020. "A Re-Solving Heuristic with Uniformly Bounded Loss for Network Revenue Management," Management Science, INFORMS, vol. 66(7), pages 2993-3009, July.
    8. Andre P. Calmon & Florin D. Ciocan & Gonzalo Romero, 2021. "Revenue Management with Repeated Customer Interactions," Management Science, INFORMS, vol. 67(5), pages 2944-2963, May.
    9. Alberto Vera & Siddhartha Banerjee, 2021. "The Bayesian Prophet: A Low-Regret Framework for Online Decision Making," Management Science, INFORMS, vol. 67(3), pages 1368-1391, March.
    10. Yuhang Ma & Paat Rusmevichientong & Mika Sumida & Huseyin Topaloglu, 2020. "An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals," Operations Research, INFORMS, vol. 68(3), pages 834-855, May.
    11. Yanzhe (Murray) Lei & Stefanus Jasin, 2020. "Real-Time Dynamic Pricing for Revenue Management with Reusable Resources, Advance Reservation, and Deterministic Service Time Requirements," Operations Research, INFORMS, vol. 68(3), pages 676-685, May.
    12. Dragos Florin Ciocan & Krishnamurthy Iyer, 2021. "Tractable Equilibria in Sponsored Search with Endogenous Budgets," Operations Research, INFORMS, vol. 69(1), pages 227-244, January.
    13. Yongbo Xiao, 2018. "Dynamic pricing and replenishment: Optimality, bounds, and asymptotics," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(1), pages 3-25, February.
    14. Strauss, Arne K. & Klein, Robert & Steinhardt, Claudius, 2018. "A review of choice-based revenue management: Theory and methods," European Journal of Operational Research, Elsevier, vol. 271(2), pages 375-387.
    15. Will Ma & David Simchi-Levi, 2020. "Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios," Operations Research, INFORMS, vol. 68(6), pages 1787-1803, November.
    16. Meissner, Joern & Strauss, Arne, 2012. "Network revenue management with inventory-sensitive bid prices and customer choice," European Journal of Operational Research, Elsevier, vol. 216(2), pages 459-468.
    17. Thomas W. M. Vossen & Dan Zhang, 2015. "Reductions of Approximate Linear Programs for Network Revenue Management," Operations Research, INFORMS, vol. 63(6), pages 1352-1371, December.
    18. Guang Li & Paat Rusmevichientong & Huseyin Topaloglu, 2015. "The d -Level Nested Logit Model: Assortment and Price Optimization Problems," Operations Research, INFORMS, vol. 63(2), pages 325-342, April.
    19. Pavithra Harsha & Shivaram Subramanian & Joline Uichanco, 2019. "Dynamic Pricing of Omnichannel Inventories," Service Science, INFORMS, vol. 21(1), pages 47-65, January.
    20. Wuyang Yuan & Lei Nie & Xin Wu & Huiling Fu, 2018. "A dynamic bid price approach for the seat inventory control problem in railway networks with consideration of passenger transfer," PLOS ONE, Public Library of Science, vol. 13(8), pages 1-23, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:63:y:2015:i:4:p:909-915. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.