The Library
An enhanced concave program relaxation for choice network revenue management
Tools
Meissner, Joern, Strauss, Arne and Talluri, Kalyan T. (2013) An enhanced concave program relaxation for choice network revenue management. Production and Operations Management, Volume 22 (Number 1). pp. 71-87. doi:10.1111/j.1937-5956.2012.01345.x ISSN 1059-1478.
|
PDF
WRAP_Strauss_PubDocView.asp.pdf - Submitted Version - Requires a PDF viewer. Download (289Kb) |
Official URL: http://dx.doi.org/10.1111/j.1937-5956.2012.01345.x
Abstract
The network choice revenue management problem models customers as choosing from an offer set, and the firm decides the best subset to offer at any given moment to maximize expected revenue. The resulting dynamic program for the firm is intractable and approximated by a deterministic linear program called the CDLP which has an exponential number of columns. However, under the choice-set paradigm
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, starting with a concave program formulation called SDCP that is based on segment-level consideration sets, we add a class of constraints called product constraints (σPC), that project onto subsets of intersections. In addition we propose a natural direct tightening of the SDCP called ESDCPκ, and compare the performance of both methods on the benchmark data sets in the literature. In our computational testing on the
benchmark data sets in the literature, 2PC achieves the CDLP value at a fraction of the CPU time taken by column generation. For a large network our 2PC procedure runs under 70 seconds to come within 0.02% of the CDLP value, while column generation takes around 1 hour; for an even larger network with 68 legs, column generation does not converge even in 10 hours for most of the scenarios while 2PC
runs under 9 minutes. Thus we believe our approach is very promising for quickly approximating CDLP when segment consideration sets overlap and the consideration sets themselves are relatively small.
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
Subjects: | H Social Sciences > HB Economic Theory Q Science > QA Mathematics |
||||
Divisions: | Faculty of Social Sciences > Warwick Business School | ||||
Library of Congress Subject Headings (LCSH): | Revenue management -- Mathematical models | ||||
Journal or Publication Title: | Production and Operations Management | ||||
Publisher: | Wiley-Blackwell Publishing Ltd. | ||||
ISSN: | 1059-1478 | ||||
Official Date: | January 2013 | ||||
Dates: |
|
||||
Volume: | Volume 22 | ||||
Number: | Number 1 | ||||
Page Range: | pp. 71-87 | ||||
DOI: | 10.1111/j.1937-5956.2012.01345.x | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |
Downloads
Downloads per month over past year