Solving Assortment Optimization with First-Order Methods and Neural Networks: A Computational Framework and Public Benchmark

讲座通知

图片

2025 年 11月 26 日(星期三),

下午 14:00 - 15:30

图片

信息管理与工程学院102室
上海财经大学(武东路校区)

上海市杨浦区武东路100号

主题

Solving Assortment Optimization with First-Order Methods and Neural Networks: A Computational Framework and Public Benchmark

图片

主讲人

王晨浩

同济大学

Dr. Chenhao Wang is a Postdoctoral Researcher in the School of Economics and Management at Tongji University. He earned his Ph.D. from the Chinese University of Hong Kong, Shenzhen and his M.S. and B.S. from Xi’an Jiaotong University. Dr. Wang specializes in revenue management, with a focus on discrete choice modeling and assortment optimization. His research has been published in Production and Operations Management.

讲座简介

Assortment optimization under complex customer choice models and operational constraints is a central challenge in revenue management. This is because its non-linear objective function, coupled with largescale and discrete decision variables, renders it computationally expensive to solve. Meanwhile, first-order methods like gradient descent have seen widespread adoption for continuous optimization in large-scale AI systems. We propose a computational framework that combines first-order methods and neural networks to efficiently solve assortment optimization. Our framework features straight-through estimators, which enable gradients to flow through discrete variables, and utilizes neural networks to perturb the gradient updates. We theoretically ground our framework by proving that our method is guaranteed to converge to the globally optimal solution for the unconstrained problem under the Multinomial Logit model (MNL). Furthermore, recognizing the need for standardized evaluation in this domain, we develop and release a public benchmark dataset. This dataset, comprising several challenging assortment optimization problems, serves both to empirically test our proposed framework and to provide a robust testbed for the wider research community to evaluate novel algorithmic solutions.