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.