A Randomized Linear Programming Method for Computing Network Bid Prices

Authors:
Kalyan Talluri;Garrett Van Ryzin
Affiliations:
-;-
Venue:
Transportation Science
Year:
1999

Citing 0
Cited 16

Revenue Management and E-Commerce

Management Science
Decision Support for Consumer Direct Grocery Initiatives

Transportation Science
Polyhedral Analysis and Algorithms for a Demand-Driven Refleeting Model for Aircraft Assignment

Transportation Science
Revenue management: models and methods

Proceedings of the 40th Conference on Winter Simulation
Using Lagrangian Relaxation to Compute Capacity-Dependent Bid Prices in Network Revenue Management

Operations Research
Robust Controls for Network Revenue Management

Manufacturing & Service Operations Management
Computing Time-Dependent Bid Prices in Network Revenue Management Problems

Transportation Science
Dynamic control mechanisms for revenue management with flexible products

Computers and Operations Research
Revenue management: models and methods

Winter Simulation Conference
Network capacity management under competition

Computational Optimization and Applications
Designing Mechanisms for the Management of Carrier Alliances

Transportation Science
Using flexible products to cope with demand uncertainty in revenue management

OR Spectrum
A Randomized Linear Programming Method for Network Revenue Management with Product-Specific No-Shows

Transportation Science
Cargo Capacity Management with Allotments and Spot Market Demand

Operations Research
Simulation-based methods for booking control in network revenue management

Proceedings of the Winter Simulation Conference
Expected Future Value Decomposition Based Bid Price Generation for Large-Scale Network Revenue Management

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyze a randomized version of the deterministic linear programming (DLP) method for computing network bid prices. The method consists of simulating a sequence of realizations of itinerary demand and solving deterministic linear programs to allocate capacity to itineraries for each realization. The dual prices from this sequence are then averaged to form a bid price approximation. This randomized linear programming (RLP) method is only slightly more complicated to implement than the DLP method. We show that the RLP method can be viewed as a procedure for estimating the gradient of the expected perfect information (PI) network revenue. That is, the expected revenue obtained with full information on future demand realizations. The expected PI revenue can, in turn, be viewed as an approximation to the optimal value function. We establish conditions under which the RLP procedure provides an unbiased estimator of the gradient of the expected PI revenue. Computational tests are performed to evaluate the revenue performance of the RLP method compared to the DLP.