Scalable Dynamic Bid Prices for Network Revenue Management in Continuous Time

This study develops an approximate optimal control problem to produce time‐dependent bid prices for the airline network revenue management problem. The main contributions of our study are the analysis of time‐dependent bid prices in continuous time and the use of splines to modify the problem into an approximate second‐order cone program (ASOCP). The spline representation of bid prices permits the number of variables to depend solely on the number of resources and not on the size of the booking horizon. The advantage of this framework is the ASOCP's scalability, which we demonstrate by solving for bid prices on an industrial‐sized network. The numerical experiments highlight the ASOCP's ability to solve industrial sized problems in seconds.

• 저널Production and Operations Management · 24(10) · 1621–1635
• 토픽Supply Chain and Inventory Management · Management Information Systems
• DOI10.1111/poms.12356
• 저자Samuel N. Kirshner, Mikhail Nediak