1000 resultados para revenue protection


Relevância:

20.00% 20.00%

Publicador:

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.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The choice network revenue management model incorporates customer purchase behavioras a function of the offered products, and is the appropriate model for airline and hotel networkrevenue management, dynamic sales of bundles, and dynamic assortment optimization.The optimization problem is a stochastic dynamic program and is intractable. A certainty-equivalencerelaxation of the dynamic program, called the choice deterministic linear program(CDLP) is usually used to generate dyamic controls. Recently, a compact linear programmingformulation of this linear program was given for the multi-segment multinomial-logit (MNL)model of customer choice with non-overlapping consideration sets. Our objective is to obtaina tighter bound than this formulation while retaining the appealing properties of a compactlinear programming representation. To this end, it is natural to consider the affine relaxationof the dynamic program. We first show that the affine relaxation is NP-complete even for asingle-segment MNL model. Nevertheless, by analyzing the affine relaxation we derive a newcompact linear program that approximates the dynamic programming value function betterthan CDLP, provably between the CDLP value and the affine relaxation, and often comingclose to the latter in our numerical experiments. When the segment consideration sets overlap,we show that some strong equalities called product cuts developed for the CDLP remain validfor our new formulation. Finally we perform extensive numerical comparisons on the variousbounds to evaluate their performance.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Annual Report of the Iowa Department of Revenue FY1996

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Annual Report of the Iowa Department of Revenue FY1997

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Annual Report of the Iowa Department of Revenue FY1998

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Annual Report of the Iowa Department of Revenue FY1999

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Annual Report of the Iowa Department of Revenue FY2000

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Annual Report of the Iowa Department of Revenue FY2001

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Annual Report of the Iowa Department of Revenue FY2002

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Annual Report of the Iowa Department of Revenue FY2003

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Annual Report of the Iowa Department of Revenue FY2004

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Annual Report of the Iowa Department of Revenue FY2005

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Addendum to Annual Report of the Iowa Department of Revenue FY2006

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Annual Report of the Iowa Department of Revenue FY2006