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

Technical Note—Approximation Schemes for Capacity-Constrained Assortment Optimization Under the Nested Logit Model

Author

Listed:
  • Danny Segev

    (Department of Statistics and Operations Research, Tel Aviv University, Tel Aviv 69978, Israel)

Abstract

The main contribution of this paper resides in proposing a carefully crafted dynamic programming approach for capacitated assortment optimization under the nested logit model in its utmost generality. Specifically, we show that the optimal revenue can be efficiently approached within any degree of accuracy by synthesizing ideas related to continuous-state dynamic programming, state space discretization, and sensitivity analysis of modified revenue functions. These developments allow us to devise the first fully polynomial-time approximation scheme in this context, thus resolving fundamental open questions posed in previous papers.

Suggested Citation

  • Danny Segev, 2022. "Technical Note—Approximation Schemes for Capacity-Constrained Assortment Optimization Under the Nested Logit Model," Operations Research, INFORMS, vol. 70(5), pages 2820-2836, September.
    • Handle: RePEc:inm:oropre:v:70:y:2022:i:5:p:2820-2836
    DOI: 10.1287/opre.2022.2336
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2022.2336
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2022.2336?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:70:y:2022:i:5:p:2820-2836. 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.