Technical Note - New Bounds for Cardinality-Constrained Assortment Optimization Under the Nested Logit Model.

Sumit Kunnumkal

Published in: Oper. Res. (2023)

Keyphrases

logit model
concave convex procedure
optimization algorithm
upper bound
lower bound
optimization problems
global optimization
multi objective
worst case
linear programming
theoretical framework
optimization method
business models
optimization process
saddle point