# A Conic Integer Programming Approach to Constrained Assortment Optimization under the Mixed Multinomial Logit Model

arXiv: https://arxiv.org/abs/1705.09040 · HTML: https://mlsanity.com/paper/1705.09040/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 25 May 2017.

## Built on by (most cited first, 1 of 1)

- [Competitive Facility Location under Random Utilities and Routing Constraints](https://mlsanity.com/paper/2403.04264/) (2024)

## Abstract (arXiv)

We consider the constrained assortment optimization problem under the mixed multinomial logit model. Even moderately sized instances of this problem are challenging to solve directly using standard mixed-integer linear optimization formulations. This has motivated recent research exploring customized optimization strategies and approximation techniques. In contrast, we develop a novel conic quadratic mixed-integer formulation. This new formulation, together with McCormick inequalities exploiting the capacity constraints, enables the solution of large instances using commercial optimization software.