Dynamic pricing strategies for multi-product revenue management problems

Consider a firm that owns a fixed capacity of a resource that is consumed in the production or delivery of multiple products. The firm’s problem is 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 where the firm controls the aggregate rate at which all products jointly consume resource capacity. Product-level controls are then chosen to maximize the instantaneous revenues subject to the constraint that they jointly consume capacity at the desired rate. This highlights the common structure of these two problems, and in some cases leads to algorithmic simplifications through the reduction in the control dimension of the associated optimization problems. In addition, we show that this reduction leads to a closed-form solutions of the associated deterministic (fluid) formulation of these problems, which, in turn, suggest several natural static and dynamic pricing heuristics that we analyze 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

multi-class make-to-order

pricing and leadtime quotation for