On upper bounds for assortment optimization under the mixture of multinomial logit models.
Sumit KunnumkalPublished in: Oper. Res. Lett. (2015)
Keyphrases
- upper bound
- multinomial logit
- probabilistic model
- lower bound
- mixture model
- theoretical analysis
- response surface
- lower and upper bounds
- optimization process
- global optimization
- optimization algorithm
- neural network
- model selection
- complex systems
- linear programming
- cost function
- optimization criteria
- prior knowledge
- mixture distributions
- genetic algorithm