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

Renwick E. Curry
Additional contact information
Renwick E. Curry: Aeronomics Incorporated, Palo Alto, California 94301

Transportation Science, 1990, vol. 24, issue 3, 193-204

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.

Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (71)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.24.3.193 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:24:y:1990:i:3:p:193-204

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().