The DOI matches its Crossref record.
A Randomized Linear Programming Method for Computing Network Bid Prices
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Revenue Management: Research Overview and Prospects
McGill, J. I., & van Ryzin, G. J. (1999) · Transportation Science · doi:10.1287/trsc.33.2.233 · Cited by 1,131
Self-citationRevenue Management Under a General Discrete Choice Model of Consumer Behavior
Talluri, K., & van Ryzin, G. (2004) · Management Science · doi:10.1287/mnsc.1030.0147 · Cited by 1,108
Self-citationAn Overview of Pricing Models for Revenue Management
Bitran, G., & Caldentey, R. (2003) · Manufacturing & Service Operations Management · doi:10.1287/msom.5.3.203.16031 · Cited by 793
On the Choice-Based Linear Programming Model for Network Revenue Management
Liu, Q., & van Ryzin, G. (2008) · Manufacturing & Service Operations Management · doi:10.1287/msom.1070.0169 · Cited by 366
Self-citationApplications of operations research in the air transport industry
Barnhart, C., Belobaba, P., & Odoni, A. R. (2003) · Transportation Science · doi:10.1287/trsc.37.4.368.23276 · Cited by 309
An overview of revenue management and dynamic pricing models in hotel business
Bandalouski, A. M., Kovalyov, M. Y., Pesch, E., & Tarim, S. A. (2018) · RAIRO - Operations Research · doi:10.1051/ro/2018001 · Cited by 25
Metadata
- Authors
- Talluri, K., & van Ryzin, G.
- Venue
- Transportation Science
- Published
- 1999-05
- Volume
- 33
- Issue
- 2
- Pages
- 207-216
- ISSN
- 0041-1655 (ISSN-L)
- 1526-5447
- OpenAlex
- W1989435499
- Cited by
- 171
- References
- 0
- FWCI
- 7.15
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.