Distributionally Robust Optimization: A Review

The concepts of risk-aversion, chance-constrained optimization, and robust optimization have developed significantly over the last decade. Statistical learning community has also witnessed a rapid theoretical and applied growth by relying on these concepts. A modeling framework, called distributionally robust optimization (DRO), has recently received significant attention in both the operations research and statistical learning communities. This paper surveys main concepts and contributions to DRO, and its relationships with robust optimization, risk-aversion, chance-constrained optimization, and function regularization

Data-Driven Chance Constrained Optimization under Wasserstein Ambiguity Sets

We present a data-driven approach for distributionally robust chance constrained optimization problems (DRCCPs). We consider the case where the decision maker has access to a finite number of samples or realizations of the uncertainty. The chance constraint is then required to hold for all distributions that are close to the empirical distribution constructed from the samples (where the distance between two distributions is defined via the Wasserstein metric). We first reformulate DRCCPs under data-driven Wasserstein ambiguity sets and a general class of constraint functions. When the feasibility set of the chance constraint program is replaced by its convex inner approximation, we present a convex reformulation of the program and show its tractability when the constraint function is affine in both the decision variable and the uncertainty. For constraint functions concave in the uncertainty, we show that a cutting-surface algorithm converges to an approximate solution of the convex inner approximation of DRCCPs. Finally, for constraint functions convex in the uncertainty, we compare the feasibility set with other sample-based approaches for chance constrained programs.Comment: A shorter version is submitted to the American Control Conference, 201

Large-scale optimization under uncertainty: applications to logistics and healthcare

Many decision making problems in real life are affected by uncertainty. The area of optimization under uncertainty has been studied widely and deeply for over sixty years, and it continues to be an active area of research. The overall aim of this thesis is to contribute to the literature by developing (i) theoretical models that reflect problem settings closer to real life than previously considered in literature, as well as (ii) solution techniques that are scalable. The thesis focuses on two particular applications to this end, the vehicle routing problem and the problem of patient scheduling in a healthcare system. The first part of this thesis studies the vehicle routing problem, which asks for a cost-optimal delivery of goods to geographically dispersed customers. The probability distribution governing the customer demands is assumed to be unknown throughout this study. This assumption positions the study into the domain of distributionally robust optimization that has a well developed literature, but had so far not been extensively studied in the context of the capacitated vehicle routing problem. The study develops theoretical frameworks that allow for a tractable solution of such problems in the context of rise-averse optimization. The overall aim is to create a model that can be used by practitioners to solve problems specific to their requirements with minimal adaptations. The second part of this thesis focuses on the problem of scheduling elective patients within the available resources of a healthcare system so as to minimize overall years of lives lost. This problem has been well studied for a long time. The large scale of a healthcare system coupled with the inherent uncertainty affecting the evolution of a patient make this a particularly difficult problem. The aim of this study is to develop a scalable optimization model that allows for an efficient solution while at the same time enabling a flexible modelling of each patient in the system. This is achieved through a fluid approximation of the weakly-coupled counting dynamic program that arises out of modeling each patient in the healthcare system as a dynamic program with states, actions, transition probabilities and rewards reflecting the condition, treatment options and evolution of a given patient. A case-study for the National Health Service in England highlights the usefulness of the prioritization scheme obtained as a result of applying the methodology developed in this study.Open Acces