报告题目 (Title)：The Transportation Problem with Random Demands and a Progressive Decoupling Algorithm for Monotropic Optimization（随机需求下的运输问题及一种用于单调优化的渐进解耦算法）
报告人 (Speaker)：Jie Sun（National University of Singapore and Curtin University）
报告时间 (Time)：2026年4月13日(周一) 13:00
报告地点 (Place)：宝山校区F309
邀请人(Inviter)：余长君
报告摘要：Consider a transportation network with deterministic supply and stochastic demand. We demonstrate that the problem is equivalent to a piecewise linear-quadratic network optimization problem when the transportation cost is linear-quadratic and the objective is to minimize the total transportation cost, along with the expected penalty imposed by the shortage/surplus of demand. Moreover, if the transportation cost is linear and the distribution of demand is discrete, then the well-known network simplex method can be extended to efficiently solve the problem. In more general cases, say if the transportation cost is convex and the distribution is continuous, the progressive decoupling algorithm of Rockafellar is well suited for the monotropic optimization problems.