An Enhanced Concave Program Relaxation for Choice Network Revenue Management
Arne Strauss and
Additional contact information
Arne Strauss: Department of Management Science, Lancaster University Management School, http://www.meiss.com/en/team/arne-strauss/
Kalyan Talluri: ICREA & Universitat Pompeu Fabra, Ramon Trias Fargas 25-27, 08005 Barcelona, Spain
No MRG/0020, Working Papers from Department of Management Science, Lancaster University
The network choice revenue management problem models customers as choosing from an offerset, 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 based on segment-level consideration sets called SDCP, we add a class of valid inequalities called product cuts, that project onto subsets of intersections. In addition we propose a natural direct tightening of the SDCP called kSDCP, and compare the performance of both methods on the benchmark data sets in the literature. Both the product cuts and the kSDCP method are very simple and easy to implement, work with general discrete choice models and are applicable to the case of overlapping segment consideration sets. In our computational testing SDCP with product cuts achieves the CDLP value at a fraction of the CPU time taken by column generation and hence has the potential to be scalable to industrial-size problems.
Keywords: operations research; marketing; bid prices; yield management; heuristics; discrete-choice; network revenue management (search for similar items in EconPapers)
JEL-codes: C61 M11 M31 L93 L83 (search for similar items in EconPapers)
Pages: 20 pages
Date: 2011-01, Revised 2011-01
New Economics Papers: this item is included in nep-cmp, nep-com, nep-dcm, nep-mic and nep-net
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1) Track citations by RSS feed
Downloads: (external link)
http://www.meiss.com/download/RM-Meissner-Strauss-Talluri.pdf Full Paper (application/pdf)
Working Paper: An Enhanced Concave Program Relaxation for Choice Network Revenue Management (2011)
Working Paper: An enhanced concave program relaxation for choice network revenue management (2011)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:lms:mansci:mrg-0020
Access Statistics for this paper
More papers in Working Papers from Department of Management Science, Lancaster University Contact information at EDIRC.
Bibliographic data for series maintained by Joern Meissner (). This e-mail address is bad, please contact .