Introduction to Linear Optimization
Introduction to Linear Optimization
Asymptotic Behavior of an Allocation Policy for Revenue Management
Operations Research
Dynamic Pricing Strategies for Multiproduct Revenue Management Problems
Manufacturing & Service Operations Management
An Asymptotically Optimal Policy for a Quantity-Based Network Revenue Management Problem
Mathematics of Operations Research
On the Choice-Based Linear Programming Model for Network Revenue Management
Manufacturing & Service Operations Management
An Analysis of the Control-Algorithm Re-solving Issue in Inventory and Revenue Management
Manufacturing & Service Operations Management
Dynamic Bid Prices in Revenue Management
Operations Research
Computing Bid Prices for Revenue Management Under Customer Choice Behavior
Manufacturing & Service Operations Management
Model Predictive Control for Dynamic Resource Allocation
Mathematics of Operations Research
| Hi-index | 0.00 |
We consider a network revenue management problem with customer choice and exogenous prices. We study the performance of a class of certainty-equivalent heuristic control policies. These heuristics periodically re-solve the deterministic linear program (DLP) that results when all future random variables are replaced by their average values and implement the solutions in a probabilistic manner. We provide an upper bound for the expected revenue loss under such policies when compared to the optimal policy. Using this bound, we construct a schedule of re-solving times such that the resulting expected revenue loss, obtained by re-solving the DLP at these times and implementing the solution as a probabilistic scheme, is bounded by a constant that is independent of the size of the problem.