121 research outputs found
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
Integer Programming Approaches for Distributionally Robust Chance Constraints with Adjustable Risks
We study distributionally robust chance constrained programs (DRCCPs) with
individual chance constraints and random right-hand sides. The DRCCPs treat the
risk tolerances associated with the distributionally robust chance constraints
(DRCCs) as decision variables to trade off between the system cost and risk of
violations by penalizing the risk tolerances in the objective function. We
consider two types of Wasserstein ambiguity sets: one with finite support and
one with a continuum of realizations. By exploring the hidden discrete
structures, we develop mixed integer programming reformulations under the two
types of ambiguity sets to determine the optimal risk tolerance for the chance
constraint. Valid inequalities are derived to strengthen the formulations. We
test instances with transportation problems of diverse sizes and a demand
response management problem
International Conference on Continuous Optimization (ICCOPT) 2019 Conference Book
The Sixth International Conference on Continuous Optimization took place on the campus of the Technical University of Berlin, August 3-8, 2019. The ICCOPT is a flagship conference of the Mathematical Optimization Society (MOS), organized every three years. ICCOPT 2019 was hosted by the Weierstrass Institute for Applied Analysis and Stochastics (WIAS) Berlin. It included a Summer School and a Conference with a series of plenary and semi-plenary talks, organized and contributed sessions, and poster sessions.
This book comprises the full conference program. It contains, in particular, the scientific program in survey style as well as with all details, and information on the social program, the venue, special meetings, and more
Distributionally robust optimization with applications to risk management
Many decision problems can be formulated as mathematical optimization models. While deterministic
optimization problems include only known parameters, real-life decision problems
almost invariably involve parameters that are subject to uncertainty. Failure to take this
uncertainty under consideration may yield decisions which can lead to unexpected or even
catastrophic results if certain scenarios are realized.
While stochastic programming is a sound approach to decision making under uncertainty, it
assumes that the decision maker has complete knowledge about the probability distribution
that governs the uncertain parameters. This assumption is usually unjustified as, for most
realistic problems, the probability distribution must be estimated from historical data and
is therefore itself uncertain. Failure to take this distributional modeling risk into account
can result in unduly optimistic risk assessment and suboptimal decisions. Furthermore, for
most distributions, stochastic programs involving chance constraints cannot be solved using
polynomial-time algorithms.
In contrast to stochastic programming, distributionally robust optimization explicitly accounts
for distributional uncertainty. In this framework, it is assumed that the decision maker has
access to only partial distributional information, such as the first- and second-order moments
as well as the support. Subsequently, the problem is solved under the worst-case distribution
that complies with this partial information. This worst-case approach effectively immunizes
the problem against distributional modeling risk.
The objective of this thesis is to investigate how robust optimization techniques can be used
for quantitative risk management. In particular, we study how the risk of large-scale derivative
portfolios can be computed as well as minimized, while making minimal assumptions about
the probability distribution of the underlying asset returns. Our interest in derivative portfolios
stems from the fact that careless investment in derivatives can yield large losses or even
bankruptcy. We show that by employing robust optimization techniques we are able to capture
the substantial risks involved in derivative investments. Furthermore, we investigate how
distributionally robust chance constrained programs can be reformulated or approximated as
tractable optimization problems. Throughout the thesis, we aim to derive tractable models
that are scalable to industrial-size problems
On the algorithmic solution of optimization problems subject to probabilistic/robust (probust) constraints
We present an adaptive grid refinement algorithm to solve probabilistic optimization problems with infinitely many random constraints. Using a bilevel approach, we iteratively aggregate inequalities that provide most information not in a geometric but in a probabilistic sense. This conceptual idea, for which a convergence proof is provided, is then adapted to an implementable algorithm. The efficiency of our approach when compared to naive methods based on uniform grid refinement is illustrated for a numerical test example as well as for a water reservoir problem with joint probabilistic filling level constraints
Stochastic programming models and methods for portfolio optimization and risk management
This project is focused on stochastic models and methods and their application in portfolio optimization and risk management. In particular it involves development and analysis of novel numerical methods for solving these types of problem. First, we study new numerical methods for a general second order stochastic dominance model where the underlying functions are not necessarily linear.Specifically, we penalize the second order stochastic dominance constraints to the objective under Slaterâs constraint qualification and then apply the well known stochastic approximation method and the level function methods to solve the penalized problem and present the corresponding convergence analysis. All methods are applied to some portfolio optimization problems, where the underlying functions are not necessarily linear all results suggests that the portfolio strategy generated by the second order stochastic dominance model outperform the strategy generated by the Markowitz model in a sense of having higher return and lower risk. Furthermore a nonlinear supply chain problem is considered, where the performance of the level function method is compared to the cutting plane method. The results suggests that the level function method is more efficient in a sense of having lower CPU time as well as being less sensitive to the problem size. This is followed by study of multivariate stochastic dominance constraints. We propose a penalization scheme for the multivariate stochastic dominance constraint and present the analysis regarding the Slater constraint qualification. The penalized problem is solved by the level function methods and a modified cutting plane method and compared to the cutting surface method proposed in [70] and the linearized method proposed in [4]. The convergence analysis regarding the proposed algorithms are presented. The proposed numerical schemes are applied to a generic budget allocation problem where it is shown that the proposed methods outperform the linearized method when the problem size is big. Moreover, a portfolio optimization problem is considered where it is shown that the a portfolio strategy generated by the multivariate second order stochastic dominance model outperform the portfolio strategy generated by the Markowitz model in sense of having higher return and lower risk. Also the performance of the algorithms is investigated with respect to the computation time and the problem size. It is shown that the level function method and the cutting plane method outperform the cutting surface method in a sense of both having lower CPU time as well as being less sensitive to the problem size. Finally, reward-risk analysis is studied as an alternative to stochastic dominance. Specifically, we study robust reward-risk ratio optimization. We propose two robust formulations, one based on mixture distribution, and the other based on the first order moment approach. We propose a sample average approximation formulation as well as a penalty scheme for the two robust formulations respectively and solve the latter with the level function method. The convergence analysis are presented and the proposed models are applied to Sortino ratio and some numerical test results are presented. The numerical results suggests that the robust formulation based on the first order moment results in the most conservative portfolio strategy compared to the mixture distribution model and the nominal model
- âŠ