## Distributionally Robust Newsvendor Problems with Variation Distance

We use distributionally robust stochastic programs (DRSPs) to model a general class of newsvendor problems where the underlying demand distribution is unknown, and so the goal is to find an order quantity that minimizes the worst-case expected cost among an ambiguity set of distributions. The ambiguity set consists of those distributions that are not far—in … Read more