An LP based approximate dynamic programming model to address airline overbooking under cancellation, refund and no-show

2Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

In this paper we simultaneously address four constraints relevant to airline revenue management problem: flight cancellation, customer no-shows, overbooking, and refunding. We develop a linear program closely related to the dynamic program formulation of the problem, which we later use to approximate the optimal decision rule for rejecting or accepting customers. First, we give a novel proof that the optimal objective function of this linear program is always an upper bound for the dynamic program. Secondly, we construct a decision rule based on this linear program and prove that it is asymptotically optimal under certain circumstances. Finally, using Monte Carlo simulation, we demonstrate that, numerically, the result of the linear programming policy presented in this paper has a short distance to the upper bound of the optimal answer, which makes it a fairly good approximate answer to the intractable dynamic program.

Cite

CITATION STYLE

APA

Soleymanifar, R. (2019). An LP based approximate dynamic programming model to address airline overbooking under cancellation, refund and no-show. Yugoslav Journal of Operations Research, 29(1), 113–133. https://doi.org/10.2298/YJOR170918026S

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free