Abstract
Bid-price control is a popular method for controlling the sale of inventory in revenue management. It is well known that the network capacity control problem can be formulated as a dynamic programming model. However, this formulation is intractable in practice due to the enormous size of the state space. As a result, various approximation methods are proposed in the literature. In this paper, we approximate the optimal dynamic programming value function with an affine function of the state vector and develop our model based on stochastic demand between origin-destination (O-D) pairs. We show that the resulting problem is the deterministic linear programming (DLP) for bid-price control. The DLP yields tighter bounds than the classical DLP. We give a column generation procedure for solving the DLP within a desired optimality tolerance, and present numerical results which show the policy perform from our solution approach can outperform that from the classical DLP.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Modelling, Identification and Control
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
