A randomized concave programming method for choice network revenue management
AbstractModels 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 InfoIf 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.
Bibliographic InfoPaper provided by Department of Economics and Business, Universitat Pompeu Fabra in its series Economics Working Papers with number 1215.
Date of creation: Apr 2010
Date of revision: Oct 2011
Contact details of provider:
Web page: http://www.econ.upf.edu/
assortment optimization; randomized algorithms; network revenue management.;
Find related papers by JEL classification:
- M11 - Business Administration and Business Economics; Marketing; Accounting - - Business Administration - - - Production Management
- M31 - Business Administration and Business Economics; Marketing; Accounting - - Marketing and Advertising - - - Marketing
- L93 - Industrial Organization - - Industry Studies: Transportation and Utilities - - - Air Transportation
- L83 - Industrial Organization - - Industry Studies: Services - - - Sports; Gambling; Restaurants; Recreation; Tourism
This paper has been announced in the following NEP Reports:
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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 references are entirely missing, you can add them using this form.