Equivalence of piecewise-linear approximation and Lagrangian relaxation for network revenue management
Contribuinte(s) |
Universitat Pompeu Fabra. Departament d'Economia i Empresa |
---|---|
Data(s) |
26/11/2012
|
Resumo |
The network revenue management (RM) problem arises in airline, hotel, media,and other industries where the sale products use multiple resources. It can be formulatedas a stochastic dynamic program but the dynamic program is computationallyintractable because of an exponentially large state space, and a number of heuristicshave been proposed to approximate it. Notable amongst these -both for their revenueperformance, as well as their theoretically sound basis- are approximate dynamic programmingmethods that approximate the value function by basis functions (both affinefunctions as well as piecewise-linear functions have been proposed for network RM)and decomposition methods that relax the constraints of the dynamic program to solvesimpler dynamic programs (such as the Lagrangian relaxation methods). In this paperwe show that these two seemingly distinct approaches coincide for the network RMdynamic program, i.e., the piecewise-linear approximation method and the Lagrangianrelaxation method are one and the same. |
Identificador | |
Idioma(s) |
eng |
Direitos |
L'accés als continguts d'aquest document queda condicionat a l'acceptació de les condicions d'ús establertes per la següent llicència Creative Commons info:eu-repo/semantics/openAccess <a href="http://creativecommons.org/licenses/by-nc-nd/3.0/es/">http://creativecommons.org/licenses/by-nc-nd/3.0/es/</a> |
Palavras-Chave | #Operations Management #network revenue management #linear programming #approximate dynamic programming #lagrangian relaxation methods |
Tipo |
info:eu-repo/semantics/workingPaper |