A strong Lagrangian relaxation for general discrete-choice network revenue management

Sumit Kunnumkal () and Kalyan Talluri ()
Additional contact information
Sumit Kunnumkal: Indian School of Business
Kalyan Talluri: South Kensington Campus

Computational Optimization and Applications, 2019, vol. 73, issue 1, No 9, 275-310

Abstract: Abstract Discrete-choice network revenue management (DC-NRM) captures both customer behavior and the resource-usage interaction of products, and is appropriate for airline and hotel revenue management, dynamic sales of bundles in advertising, and dynamic assortment optimization in retail. The state-space of the DC-NRM stochastic dynamic program explodes and approximation methods such as the choice deterministic linear program, the affine, and the piecewise-linear approximations have been proposed to approximate it in practice. The affine relaxation (and thereby, its generalization, the piecewise-linear approximation) is intractable even for the simplest choice models such as the multinomial logit (MNL) choice model with a single segment. In this paper we propose a new Lagrangian relaxation method for DC-NRM based on an extended set of multipliers. An attractive feature of our method is that the number of constraints in our formulation scales linearly with the resource capacities. While the number of constraints in our formulation is an order of magnitude smaller that the piecewise-linear approximation (polynomial vs exponential), it obtains a bound that is as tight as the piecewise-linear bound. If we assume that the consideration sets of the different customer segments are small in size—a reasonable modeling tradeoff in many practical applications—our method is an indirect way to obtain the piecewise-linear approximation on large problems effectively. Our results are not specific to a particular functional form (such as MNL), but hold for any discrete-choice model of demand. We show by numerical experiments that our Lagrangian relaxation method can provide substantial improvements over existing benchmark methods, both in terms of tighter upper bounds, as well as revenues from policies based on the relaxation.

Keywords: Dynamic programming approximations; Transportation; Revenue management; Choice models (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10589-019-00068-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:coopap:v:73:y:2019:i:1:d:10.1007_s10589-019-00068-y

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-019-00068-y

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().