Note on Quantity Based Revenue Management: The Single Resource Case

One of the most basic revenue management problems is how to allocate a fixed capacity to various types of classes of customers so that the total profit is maximized. Using the example of a flight traveling from Toronto to Vancouver, the revenue management problem is to decide, in each period, how much of the realized demand to accept and how much to reserve for the latter classes in order maximize the revenue. The crux of the problem revolves around the trade-off between spoilage and dilution. The author uses various mathematical formulae (including the static model, Littlewood’s Two-Class model and n-Class model of expected marginal seat revenue) to model optimal seat-allocation outcomes.