On upper bounds for assortment optimization under the mixture of multinomial logit models

DOI10.1016/j.orl.2015.01.010zbMath1408.62193OpenAlexW1967402052MaRDI QIDQ1785635

Sumit Kunnumkal

Publication date: 1 October 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: http://eprints.exchange.isb.edu/382/1/mixedLogit_bounds.pdf

zbMATH Keywords

upper boundsassortment optimizationcustomer choicemultinomial logit

Mathematics Subject Classification ID

Applications of statistics to economics (62P20) Consumer behavior, demand theory (91B42)

Related Items (4)

Robust assortment optimization under sequential product unavailability ⋮ Fractional 0-1 programming and submodularity ⋮ Tractable Approximations for Assortment Planning with Product Costs ⋮ Robust assortment optimization using worst-case CVaR under the multinomial logit model

Cites Work

• New Formulations for Choice Network Revenue Management
• A Column Generation Algorithm for Choice-Based Network Revenue Management
• Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model
• A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One

This page was built for publication: On upper bounds for assortment optimization under the mixture of multinomial logit models