Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

An Exact Method for Assortment Optimization under the Nested Logit Model

Abstract : We study the problem of finding an optimal assortment of products maximizing the expected revenue, in which customer preferences are modeled using a Nested Logit choice model. This problem is known to be polynomially solvable in a specific case and NP-hard otherwise, with only approximation algorithms existing in the literature. For the NP-hard cases, we provide a general exact method that embeds a tailored Branch-and-Bound algorithm into a fractional programming framework. Contrary to the existing literature, in which assumptions are imposed on either the structure of nests or the combination and characteristics of products, no assumptions on the input data are imposed, and hence our approach can solve the most general problem setting. We show that the parameterized subproblem of the fractional programming scheme, which is a binary highly non-linear optimization problem, is decomposable by nests, which is a main advantage of the approach. To solve the subproblem for each nest, we propose a two-stage approach. In the first stage, we identify those products that are undoubtedly beneficial to offer, or not, which can significantly reduce the problem size. In the second stage, we design a tailored Branch-and-Bound algorithm with problem-specific upper bounds. Numerical results show that the approach is able to solve assortment instances with up to 5,000 products per nest. The most challenging instances for our approach are those in which the dissimilarity parameters of nests can be either less or greater than one.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [28 references]  Display  Hide  Download

https://hal-essec.archives-ouvertes.fr/hal-02463159
Contributor : Michel Demoura <>
Submitted on : Friday, January 31, 2020 - 5:24:15 PM
Last modification on : Saturday, April 4, 2020 - 1:04:05 AM
Document(s) archivé(s) le : Friday, May 1, 2020 - 5:16:11 PM

File

WP 2001.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02463159, version 1

Collections

Citation

Laurent Alfandari, Alborz Hassanzadeh, Ivana Ljubic. An Exact Method for Assortment Optimization under the Nested Logit Model. 2020. ⟨hal-02463159⟩

Share

Metrics

Record views

75

Files downloads

177