IDEAS home Printed from https://ideas.repec.org/a/bla/popmgt/v28y2019i5p1238-1255.html
   My bibliography  Save this article

Relating the Approximability of the Fixed Cost and Space Constrained Assortment Problems

Author

Listed:
  • Jacob Feldman
  • Alice Paul

Abstract

We study the classic assortment optimization problem in which a retailer seeks the revenue maximizing set of products to offer to each arriving customer. This study relates two variants of this assortment problem: the space constrained assortment problem, in which the retailer has a limit on the total space of the offered assortment, and the fixed cost assortment problem, in which the retailer incurs a fixed cost for each offered product. In particular, we develop an approximation scheme for the space constrained problem for any random utility choice model that only relies on the ability to solve the corresponding fixed cost assortment problem. We then apply this technique to give a constant factor approximation scheme for the space constrained assortment problem under a classical model for vertically differentiated products. Last, we present computational results to show the efficacy of this approach.

Suggested Citation

  • Jacob Feldman & Alice Paul, 2019. "Relating the Approximability of the Fixed Cost and Space Constrained Assortment Problems," Production and Operations Management, Production and Operations Management Society, vol. 28(5), pages 1238-1255, May.
    • Handle: RePEc:bla:popmgt:v:28:y:2019:i:5:p:1238-1255
    DOI: 10.1111/poms.12983
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/poms.12983
    Download Restriction: no
    File URL: https://libkey.io/10.1111/poms.12983?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:bla:popmgt:v:28:y:2019:i:5:p:1238-1255. 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: Wiley Content Delivery (email available below). General contact details of provider: http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1937-5956 .

    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.