Advanced Search
MyIDEAS: Login

A randomized concave programming method for choice network revenue management

Contents:

Author Info

Registered author(s):

    Abstract

    Models incorporating more realistic models of customer behavior, as customers choosing from an offer set, have recently become popular in assortment optimization and revenue management. The dynamic program for these models is intractable and approximated by a deterministic linear program called the CDLP which has an exponential number of columns. However, when the segment consideration sets overlap, the CDLP is difficult to solve. Column generation has been proposed but finding an entering column has been shown to be NP-hard. In this paper we propose a new approach called SDCP to solving CDLP based on segments and their consideration sets. SDCP is a relaxation of CDLP and hence forms a looser upper bound on the dynamic program but coincides with CDLP for the case of non-overlapping segments. If the number of elements in a consideration set for a segment is not very large (SDCP) can be applied to any discrete-choice model of consumer behavior. We tighten the SDCP bound by (i) simulations, called the randomized concave programming (RCP) method, and (ii) by adding cuts to a recent compact formulation of the problem for a latent multinomial-choice model of demand (SBLP+). This latter approach turns out to be very effective, essentially obtaining CDLP value, and excellent revenue performance in simulations, even for overlapping segments. By formulating the problem as a separation problem, we give insight into why CDLP is easy for the MNL with non-overlapping considerations sets and why generalizations of MNL pose difficulties. We perform numerical simulations to determine the revenue performance of all the methods on reference data sets in the literature.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.econ.upf.edu/docs/papers/downloads/1215.pdf
    File Function: Whole Paper
    Download Restriction: no

    Bibliographic Info

    Paper provided by Department of Economics and Business, Universitat Pompeu Fabra in its series Economics Working Papers with number 1215.

    as in new window
    Length:
    Date of creation: Apr 2010
    Date of revision: Oct 2011
    Handle: RePEc:upf:upfgen:1215

    Contact details of provider:
    Web page: http://www.econ.upf.edu/

    Related research

    Keywords: assortment optimization; randomized algorithms; network revenue management.;

    Find related papers by JEL classification:

    This paper has been announced in the following NEP Reports:

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:upf:upfgen:1215. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ().

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

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