IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v43y1995i2p252-263.html
   My bibliography  Save this article

Optimal and Approximate Control Policies for Airline Booking with Sequential Nonmonotonic Fare Classes

Author

Listed:
  • Lawrence W. Robinson

    (Cornell University, Ithaca, New York)

Abstract

This paper addresses the question of when to refuse discount bookings from airline passengers to reserve seats for potential future passengers who are willing to pay a higher fare. When passengers arrive in sequential fare classes, the optimal policy will be to accept reservation requests as long as the cumulative seats booked does not exceed a given booking limit. This paper relates the probability of filling the plane, under the optimal policy, with the ratios of the current to the highest remaining fare classes. In addition, it extends the solution from monotonically increasing fares to fares occurring in arbitrary order. Finally, it demonstrates how Monte Carlo integration is easy to use to get arbitrarily close approximations to the optimal policy.

Suggested Citation

  • Lawrence W. Robinson, 1995. "Optimal and Approximate Control Policies for Airline Booking with Sequential Nonmonotonic Fare Classes," Operations Research, INFORMS, vol. 43(2), pages 252-263, April.
    • Handle: RePEc:inm:oropre:v:43:y:1995:i:2:p:252-263
    DOI: 10.1287/opre.43.2.252
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.43.2.252
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.43.2.252?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:43:y:1995:i:2:p:252-263. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.