We introduce a new distributionally robust optimization model to address a two-period, multi-item joint pricing and production problem, which can be implemented in a data-driven setting using historical demand and side information pertinent to the prediction of demands. Starting from an additive demand model we introduce a new partitioned-moment-based ambiguity set to characterize its residuals. Unlike the standard moment-based ambiguity set, we can adjust the level of robustness by varying the number of information clusters from being the most robust as the standard moment-based ambiguity set with one cluster to being the least robust as the empirical distribution. The partitioned-moment-based ambiguity set also addresses the key challenge...
We consider a robust version of the classic problem of optimal monopoly pricing with incomplete info...
We investigate a joint pricing and purchasing problem for the dual-channel newsvendor model with the...
We consider a robust version of the classic problem of optimal monopoly pricing with incomplete info...
This dissertation investigates robust optimization for use in demand forecasting. Techniques of robu...
This dissertation consists of two distinct lines of research e orts. Chapter 2 proposes a general me...
We propose a formulation of a distributionally robust approach to model certain structural informat...
We consider a robust version of the classic problem of optimal monopoly pricing with incomplete info...
We consider a robust version of the classic problem of optimal monopoly pricing with incomplete info...
In this thesis, we consider optimal hedging decisions for an electricity producer. In addition to ac...
In classical newsvendor games, vendors collaborate to serve their aggregate demand whose joint distr...
We introduce ambiguity sets based on the nested distance for stochastic processes. We show how these...
We use distributionally robust stochastic programs (DRSP) to model a general class of newsvendor pro...
We study a dynamic pricing problem, where a firm offers a product to be sold over a fixed time horiz...
This thesis studies a classic single-period stochastic optimization problem called the newsvendor pr...
This paper considers model uncertainty for multistage stochastic programs. The data and information ...
We consider a robust version of the classic problem of optimal monopoly pricing with incomplete info...
We investigate a joint pricing and purchasing problem for the dual-channel newsvendor model with the...
We consider a robust version of the classic problem of optimal monopoly pricing with incomplete info...
This dissertation investigates robust optimization for use in demand forecasting. Techniques of robu...
This dissertation consists of two distinct lines of research e orts. Chapter 2 proposes a general me...
We propose a formulation of a distributionally robust approach to model certain structural informat...
We consider a robust version of the classic problem of optimal monopoly pricing with incomplete info...
We consider a robust version of the classic problem of optimal monopoly pricing with incomplete info...
In this thesis, we consider optimal hedging decisions for an electricity producer. In addition to ac...
In classical newsvendor games, vendors collaborate to serve their aggregate demand whose joint distr...
We introduce ambiguity sets based on the nested distance for stochastic processes. We show how these...
We use distributionally robust stochastic programs (DRSP) to model a general class of newsvendor pro...
We study a dynamic pricing problem, where a firm offers a product to be sold over a fixed time horiz...
This thesis studies a classic single-period stochastic optimization problem called the newsvendor pr...
This paper considers model uncertainty for multistage stochastic programs. The data and information ...
We consider a robust version of the classic problem of optimal monopoly pricing with incomplete info...
We investigate a joint pricing and purchasing problem for the dual-channel newsvendor model with the...
We consider a robust version of the classic problem of optimal monopoly pricing with incomplete info...