An Enhanced Concave Program Relaxation for Choice Network Revenue Management
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.
|Date of creation:||Jan 2011|
|Date of revision:||Jan 2011|
|Contact details of provider:|| Web page: http://www.lums.lancs.ac.uk/departments/ManSci/|
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Qian Liu & Garrett van Ryzin, 2008. "On the Choice-Based Linear Programming Model for Network Revenue Management," Manufacturing & Service Operations Management, INFORMS, vol. 10(2), pages 288-310, October.
- Meissner, Joern & Strauss, Arne, 2012.
"Network revenue management with inventory-sensitive bid prices and customer choice,"
European Journal of Operational Research,
Elsevier, vol. 216(2), pages 459-468.
- Joern Meissner & Arne Strauss, 2008. "Network Revenue Management with Inventory-Sensitive Bid Prices and Customer Choice," Working Papers MRG/0008, Department of Management Science, Lancaster University, revised Apr 2010.
When requesting a correction, please mention this item's handle: RePEc:lms:mansci:mrg-0020. 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: (Joern Meissner)
If references are entirely missing, you can add them using this form.