Dynamic Bid Prices in Revenue Management
Author:
- 1 August 2007
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 55 (4) , 647-661
Abstract
We formally derive the standard deterministic linear program (LP) for bid-price control by making an affine functional approximation to the optimal dynamic programming value function. This affine functional approximation gives rise to a new LP that yields tighter bounds than the standard LP. Whereas the standard LP computes static bid prices, our LP computes a time trajectory of bid prices. We show that there exist dynamic bid prices, optimal for the LP, that are individually monotone with respect to time. We provide a column generation procedure for solving the LP within a desired optimality tolerance, and present numerical results on computational and economic performance.Keywords
This publication has 9 references indexed in Scilit:
- Simulation-Based Booking Limits for Airline Revenue ManagementOperations Research, 2005
- The Theory and Practice of Revenue Management2004
- The Linear Programming Approach to Approximate Dynamic ProgrammingOperations Research, 2003
- Revenue Management in a Dynamic Network EnvironmentTransportation Science, 2003
- Asymptotic Behavior of an Allocation Policy for Revenue ManagementOperations Research, 2002
- Revenue Management: Research Overview and ProspectsTransportation Science, 1999
- An Analysis of Bid-Price Controls for Network Revenue ManagementManagement Science, 1998
- Markov Decision Processes1994
- Generalized polynomial approximations in Markovian decision processesJournal of Mathematical Analysis and Applications, 1985