Assortment Optimization and the Sample Average Approximation
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916982624878592 |
|---|---|
| author | Khalid, Hassaan Sturt, Bradley |
| author_facet | Khalid, Hassaan Sturt, Bradley |
| contents | We consider a simple approach to solving assortment optimization under the random utility maximization model. The approach uses Monte-Carlo simulation to construct a ranking-based choice model that serves as a proxy for the true choice model, followed by finding an assortment that is optimal with respect to that proxy. In this paper, we make that approach more viable by developing faster algorithms for finding assortments that are optimal under ranking-based choice models. Our algorithms are based on mixed-integer programming and consist of stronger formulations as well as new structural and algorithmic results related to Benders cuts. We demonstrate that our algorithms - without any heuristics or parameter tuning - can offer more than a 20x speedup in real-world settings with thousands of products and samples. Equipped with our algorithms, we showcase the value of using the sample average approximation to solve assortment optimization problems for which no practically efficient algorithms are known. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_00850 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Assortment Optimization and the Sample Average Approximation Khalid, Hassaan Sturt, Bradley Optimization and Control We consider a simple approach to solving assortment optimization under the random utility maximization model. The approach uses Monte-Carlo simulation to construct a ranking-based choice model that serves as a proxy for the true choice model, followed by finding an assortment that is optimal with respect to that proxy. In this paper, we make that approach more viable by developing faster algorithms for finding assortments that are optimal under ranking-based choice models. Our algorithms are based on mixed-integer programming and consist of stronger formulations as well as new structural and algorithmic results related to Benders cuts. We demonstrate that our algorithms - without any heuristics or parameter tuning - can offer more than a 20x speedup in real-world settings with thousands of products and samples. Equipped with our algorithms, we showcase the value of using the sample average approximation to solve assortment optimization problems for which no practically efficient algorithms are known. |
| title | Assortment Optimization and the Sample Average Approximation |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2510.00850 |