IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v24y1990i3p193-204.html
   My bibliography  Save this article

Optimal Airline Seat Allocation with Fare Classes Nested by Origins and Destinations

Author

Listed:
  • Renwick E. Curry

    (Aeronomics Incorporated, Palo Alto, California 94301)

Abstract

Previous research in the optimal allocation of airline seats has followed one of two themes: marginal seat revenue or mathematical programming. Both approaches capture important elements of the revenue management problem. The marginal seat revenue approach accounts for the “nesting” of fare classes in computer reservation systems, but can only control seat inventory by bookings on legs. The mathematical programming approach will handle realistically large problems and will account for multiple origin–destination itineraries and side constraints, but it does not account for fare class nesting in the reservation systems. This paper combines both approaches by developing equations to find the optimal allocation of seats when fare classes are nested on an origin–destination itinerary and the inventory is not shared among origin–destinations. These results are applicable to seat allocation in certain reservations systems, point-of-sale control, and acceptance of groups over their entire itinerary. A special case of the analysis produces the optimal booking limits for leg-based seat allocation with nested fare classes.

Suggested Citation

  • Renwick E. Curry, 1990. "Optimal Airline Seat Allocation with Fare Classes Nested by Origins and Destinations," Transportation Science, INFORMS, vol. 24(3), pages 193-204, August.
    • Handle: RePEc:inm:ortrsc:v:24:y:1990:i:3:p:193-204
    DOI: 10.1287/trsc.24.3.193
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.24.3.193
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.24.3.193?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:ortrsc:v:24:y:1990:i:3:p:193-204. 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.