 The Value of Robust Assortment Optimization Under Ranking-Based Choice ModelsBradley Sturt ()
Management Science, 2025, vol. 71, issue 5, 4246-4265 Abstract: We study a class of robust assortment optimization problems that was proposed by Farias et al. [Farias VF, Jagabathula S, Shah D (2013) A nonparametric approach to modeling choice with limited data. Management Sci. 59(2):305–322]. The goal in these problems is to find an assortment that maximizes a firm’s worst-case expected revenue under all ranking-based choice models that are consistent with the historical sales data generated by the firm’s past assortments. We establish for various settings that these robust optimization problems can either be solved in polynomial time or can be reformulated as compact mixed-integer optimization problems. To establish our results, we prove that optimal assortments for these robust optimization problems have a simple structure that is closely related to the structure of revenue-ordered assortments. We use our results to show how robust optimization can be used to overcome the risks of estimate-then-optimize and the need for experimentation with ranking-based choice models in the overparameterized regime. Keywords: assortment planning; robust optimization; nonparametric choice modeling (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:71:y:2025:i:5:p:4246-4265 Access Statistics for this article More articles in Management Science from INFORMS Contact information at EDIRC. |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.