{"title":"Technical Note - New Bounds for Cardinality-Constrained Assortment Optimization Under the Nested Logit Model","authors":"S. Kunnumkal","doi":"10.1287/opre.2023.2469","DOIUrl":null,"url":null,"abstract":"Assortment optimization involves determining the optimal set of products to show customers and is a fundamental problem in retail operations. The nested logit choice model is a popular and widely used choice model to capture customer behavior. In “New Bounds for Cardinality-Constrained Assortment Optimization Under the Nested Logit Model,” Kunnumkal presents a new method for making the assortment decisions under the nested logit choice model when there is a constraint on the number of products that can be offered within each nest. Computational experiments reveal that the assortments obtained by the solution method are near optimal, with the average optimality gap being under 1%.","PeriodicalId":19546,"journal":{"name":"Oper. Res.","volume":"303 1","pages":"1112-1119"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Oper. Res.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/opre.2023.2469","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Assortment optimization involves determining the optimal set of products to show customers and is a fundamental problem in retail operations. The nested logit choice model is a popular and widely used choice model to capture customer behavior. In “New Bounds for Cardinality-Constrained Assortment Optimization Under the Nested Logit Model,” Kunnumkal presents a new method for making the assortment decisions under the nested logit choice model when there is a constraint on the number of products that can be offered within each nest. Computational experiments reveal that the assortments obtained by the solution method are near optimal, with the average optimality gap being under 1%.