Constrained Assortment Optimization Problem under the Multilevel Nested Logit Model

Autor:	Yanqiao Wang, Z. Max Shen
Rok vydání:	2021
Předmět:	Computer Science::Computer Science and Game Theory Polynomial Mathematical optimization Optimization problem Profit (accounting) Computational complexity theory Management Science and Operations Research Industrial and Manufacturing Engineering Constraint (information theory) Cardinality Management of Technology and Innovation Product (mathematics) Node (circuits) Mathematics
Zdroj:	Production and Operations Management. 30:3467-3480
ISSN:	1937-5956 1059-1478
DOI:	10.1111/poms.13443
Popis:	We study the choice‐based constrained assortment optimization problem under the multilevel nested logit model with a no‐purchase option in every choice stage. For this problem, each candidate product is associated with a fixed profit. The goal is to identify the optimal assortment satisfying a cardinality constraint to maximize the expected profit per customer. There is a cardinality limitation imposed on nodes in the second lowest level. A polynomial‐time algorithm with computational complexity O(nmax{m, k}) is provided to locate the optimal assortment for the m‐level nested logit model with n products, where k is the maximum number of products within any node in level m − 1.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::cab5d1183e78c58d393f6e622802c274 https://doi.org/10.1111/poms.13443 Zobrazit plný text záznamu Plný text ve formátu PDF Plný text ve formátu HTML
Nepřihlášeným uživatelům se plný text nezobrazuje	K zobrazení výsledku je třeba se přihlásit.