Abstract
Consider a firm that owns a fixed capacity of a resource that is consumed in the production or delivery of multiple products. The firm strives to maximize its total expected revenues over a finite horizon, either by choosing a dynamic pricing strategy for each product or, if prices are fixed, by selecting a dynamic rule that controls the allocation of capacity to requests for the different products. This paper shows how these well-studied revenue management problems can be reduced to a common formulation in which the firm controls the aggregate rate at which all products jointly consume resource capacity, highlighting their common structure, and in some cases leading to algorithmic simplifications through the reduction in the control dimension of the associated optimization problems. In the context of their associated deterministic (fluid) formulations, this reduction leads to a closed-form characterization of the optimal controls, and suggests several natural static and dynamic pricing heuristics. These are analyzed asymptotically and through an extensive numerical study. In the context of the former, we show that "resolving" the fluid heuristic achieves asymptotically optimal performance under fluid scaling.