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

Revenue Management Under a Mixture of Independent Demand and Multinomial Logit Models

Author

Listed:
  • Yufeng Cao

    (Antai College of Economics and Management, Shanghai Jiao Tong University, Shanghai 200030, China)

  • Paat Rusmevichientong

    (Marshall School of Business, University of Southern California, Los Angeles, California 90089)

  • Huseyin Topaloglu

    (School of Operations Research and Information Engineering, Cornell Tech, New York, New York 10044)

Abstract

We consider assortment optimization problems when customers choose under a mixture of independent demand and multinomial logit models. In the assortment optimization setting, each product has a fixed revenue associated with it. The customers choose among the products according to our mixture choice model. The goal is to find an assortment that maximizes the expected revenue from a customer. We show that we can find the optimal assortment by solving a linear program. We establish that the optimal assortment becomes larger as the relative size of the customer segment with the independent demand model increases. Moreover, we show that the Pareto-efficient assortments that maximize a weighted average of the expected revenue and the total purchase probability are nested, in the sense that the Pareto-efficient assortments become larger as the weight on the total purchase probability increases. Considering the assortment optimization problem with a capacity constraint on the offered assortment, we show that the problem is NP-hard, even when each product consumes unit capacity, so that we have a constraint on the number of offered products. We give a fully polynomial-time approximation scheme. In the assortment-based network revenue-management problem, we have resources with limited capacities, and each product consumes a combination of resources. The goal is to find a policy for deciding which assortment of products to offer to each arriving customer to maximize the total expected revenue over a finite selling horizon. A standard linear-programming approximation for this problem includes one decision variable for each subset of products. We show that this linear program can be reduced to an equivalent one of substantially smaller size. We give an expectation-maximization algorithm to estimate the parameters of our mixture model. Our computational experiments indicate that our mixture model can provide improvements in predicting customer purchases and identifying profitable assortments.

Suggested Citation

  • Yufeng Cao & Paat Rusmevichientong & Huseyin Topaloglu, 2023. "Revenue Management Under a Mixture of Independent Demand and Multinomial Logit Models," Operations Research, INFORMS, vol. 71(2), pages 603-625, March.
  • Handle: RePEc:inm:oropre:v:71:y:2023:i:2:p:603-625
    DOI: 10.1287/opre.2022.2333
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2022.2333
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2022.2333?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
    ---><---

    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:71:y:2023:i:2:p:603-625. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.