Reductions of Approximate Linear Programs for Network Revenue Management

The linear programming approach to approximate dynamic programming has received considerable attention in the recent network revenue management literature. A major challenge of the approach lies in solving the resulting approximate linear programs (ALPs), which often have a huge number of constraints and/or variables. We show that the ALPs can be dramatically reduced in size for both affine and separable piecewise linear approximations to network revenue management problems, under both independent and discrete choice models of demand. Our key result is the equivalence between each ALP and a corresponding reduced program, which is more compact in size and admits an intuitive probabilistic interpretation. For the affine approximation to network revenue management under an independent demand model, we recover an equivalence result known in the literature, but provide an alternative proof. Our other equivalence results are new. We test the numerical performance of solving the reduced programs directly using o...

[1]  Warren B. Powell,et al.  Approximate Dynamic Programming - Solving the Curses of Dimensionality , 2007 .

[2]  P. Schweitzer,et al.  Generalized polynomial approximations in Markovian decision processes , 1985 .

[3]  Dan Zhang,et al.  An Approximate Dynamic Programming Approach to Network Revenue Management with Customer Choice , 2009, Transp. Sci..

[4]  D. D. Farias,et al.  On constraint sampling in the linear programming approach to approximate linear programming , 2003, CDC.

[5]  G. Dantzig,et al.  THE DECOMPOSITION ALGORITHM FOR LINEAR PROGRAMS , 1961 .

[6]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[7]  G. Nemhauser,et al.  Integer Programming , 2020 .

[8]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[9]  John N. Tsitsiklis,et al.  Neuro-Dynamic Programming , 1996, Encyclopedia of Machine Learning.

[10]  Garrett J. van Ryzin,et al.  On the Choice-Based Linear Programming Model for Network Revenue Management , 2008, Manuf. Serv. Oper. Manag..

[11]  Ioana Popescu,et al.  Revenue Management in a Dynamic Network Environment , 2003, Transp. Sci..

[12]  Garrett J. van Ryzin,et al.  A Multiproduct Dynamic Pricing Problem and Its Applications to Network Yield Management , 1997, Oper. Res..

[13]  J. Desrosiers,et al.  A Primer in Column Generation , 2005 .

[14]  Warren B. Powell,et al.  Approximate Dynamic Programming: Solving the Curses of Dimensionality (Wiley Series in Probability and Statistics) , 2007 .

[15]  Sumit Kunnumkal,et al.  Equivalence of Piecewise-Linear Approximation and Lagrangian Relaxation for Network Revenue Management , 2011 .

[16]  Jacques Desrosiers,et al.  Dual-Optimal Inequalities for Stabilized Column Generation , 2003, Oper. Res..

[17]  Daniel Adelman,et al.  Relaxations of Weakly Coupled Stochastic Dynamic Programs , 2008, Oper. Res..

[18]  Warren B. Powell,et al.  “Approximate dynamic programming: Solving the curses of dimensionality” by Warren B. Powell , 2007, Wiley Series in Probability and Statistics.

[19]  Dan Zhang,et al.  Revenue Management for Parallel Flights with Customer-Choice Behavior , 2005, Oper. Res..

[20]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[21]  K. Talluri,et al.  An Analysis of Bid-Price Controls for Network Revenue Management , 1998 .

[22]  Arne Strauss,et al.  Network revenue management with inventory-sensitive bid prices and customer choice , 2012, Eur. J. Oper. Res..

[23]  F. Tardella.  On the equivalence between some discrete and continuous optimization problems , 1991 .

[24]  Dan Zhang,et al.  A Dynamic Disaggregation Approach to Approximate Linear Programs for Network Revenue Management , 2015 .

[25]  Daniel Adelman,et al.  Dynamic Bid Prices in Revenue Management , 2007, Oper. Res..

[26]  Kalyan T. Talluri,et al.  On Bounds for Network Revenue Management , 2008 .

[27]  Shaler Stidham,et al.  The Underlying Markov Decision Process in the Single-Leg Airline Yield-Management Problem , 1999, Transp. Sci..

[28]  Garrett J. van Ryzin,et al.  Revenue Management Under a General Discrete Choice Model of Consumer Behavior , 2004, Manag. Sci..

[29]  Benjamin Van Roy,et al.  An Approximate Dynamic Programming Approach to Network Revenue Management , 2006 .

[30]  Huseyin Topaloglu,et al.  On the Approximate Linear Programming Approach for Network Revenue Management Problems , 2014, INFORMS J. Comput..

[31]  William L. Cooper.  Asymptotic Behavior of an Allocation Policy for Revenue Management , 2002, Oper. Res..

[32]  Huseyin Topaloglu,et al.  Using Lagrangian Relaxation to Compute Capacity-Dependent Bid Prices in Network Revenue Management , 2009, Oper. Res..

[33]  K. Talluri,et al.  On the tractability of the piecewise-linear approximation for general discrete-choice network revenue management , 2014 .

[34]  Benjamin Van Roy,et al.  The Linear Programming Approach to Approximate Dynamic Programming , 2003, Oper. Res..