IDEAS home Printed from https://ideas.repec.org/a/now/fnttom/0200000114-5.html
   My bibliography  Save this article

Multi-Objective Assortment Optimization: Profit, Risk, Customer Utility, and Beyond

Author

Listed:
  • Zhen Chen
  • Heng Zhang
  • Hongmin Li
  • Scott Webster

Abstract

Assortment optimization is a fundamental challenge in revenue management, aiming to offer a subset from all products on hand to maximize expected revenue. However, businesses often face multiple goals that go far beyond revenue, and these goals are sometimes even in conflict with each other. In this study, we introduce a comprehensive framework and a new reformulation technique for tackling multi-objective assortment optimization problems. We focus on the sum of multiple convex objective functions (i.e., the tradeoff between distinct objectives), and we propose a reformulation that effectively “linearizes” the problem. We demonstrate that this reformulated problem is equivalent to the original and provides a unified solution approach for various multi-objective contexts. Our method covers a broad range of operational objectives, such as risk, customer utility, market share, costs with economies of scale, and dualized convex constraints. We analyze the multi-objective problem in the context of the multinomial logit model, the nested logit model, and the Markov chain choice model, and demonstrate the effciency and practicality of our approach through extensive numerical experiments. Our work presents a powerful and versatile tool for addressing multi-objective assortment problems frequently encountered in real-world revenue management scenarios.

Suggested Citation

  • Zhen Chen & Heng Zhang & Hongmin Li & Scott Webster, 2024. "Multi-Objective Assortment Optimization: Profit, Risk, Customer Utility, and Beyond," Foundations and Trends(R) in Technology, Information and Operations Management, now publishers, vol. 18(1), pages 103-115, August.
  • Handle: RePEc:now:fnttom:0200000114-5
    DOI: 10.1561/0200000114-5
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1561/0200000114-5
    Download Restriction: no

    File URL: https://libkey.io/10.1561/0200000114-5?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:now:fnttom:0200000114-5. 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: Lucy Wiseman (email available below). General contact details of provider: http://www.nowpublishers.com/ .

    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.