An enhanced concave program relaxation for choice network revenue management
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 based on segment-level consideration sets called SDCP, we add a class of constraints called product constraints, that project onto subsets of intersections. In addition we propose a natural direct tightening of the SDCP called ?SDCP, and compare the performance of both methods on the benchmark data sets in the literature. Both the product constraints and the ?SDCP method are very simple and easy to implement and are applicable to the case of overlapping segment consideration sets. In our computational testing on the benchmark data sets in the literature, SDCP with product constraints achieves the CDLP value at a fraction of the CPU time taken by column generation and we believe is a very promising approach for quickly approximating CDLP when segment consideration sets overlap and the consideration sets themselves are relatively small.
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.:
- 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.
- 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.
When requesting a correction, please mention this item's handle: RePEc:upf:upfgen:1259. 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 references are entirely missing, you can add them using this form.