Processing second-order stochastic dominance models using cutting-plane representations

This is the post-print version of the Article. The official published version can be accessed from the links below. Copyright @ 2011 Springer-VerlagSecond-order stochastic dominance (SSD) is widely recognised as an important decision criterion in portfolio selection. Unfortunately, stochastic dominance models are known to be very demanding from a computational point of view. In this paper we consider two classes of models which use SSD as a choice criterion. The first, proposed by Dentcheva and Ruszczyński (J Bank Finance 30:433–451, 2006), uses a SSD constraint, which can be expressed as integrated chance constraints (ICCs). The second, proposed by Roman et al. (Math Program, Ser B 108:541–569, 2006) uses SSD through a multi-objective formulation with CVaR objectives. Cutting plane representations and algorithms were proposed by Klein Haneveld and Van der Vlerk (Comput Manage Sci 3:245–269, 2006) for ICCs, and by Künzi-Bay and Mayer (Comput Manage Sci 3:3–27, 2006) for CVaR minimization. These concepts are taken into consideration to propose representations and solution methods for the above class of SSD based models. We describe a cutting plane based solution algorithm and outline implementation details. A computational study is presented, which demonstrates the effectiveness and the scale-up properties of the solution algorithm, as applied to the SSD model of Roman et al. (Math Program, Ser B 108:541–569, 2006).This study was funded by OTKA, Hungarian National Fund for Scientific Research, project 47340; by Mobile Innovation Centre, Budapest University of Technology, project 2.2; Optirisk Systems, Uxbridge, UK and by BRIEF (Brunel University Research Innovation and Enterprise Fund)

Generalized Decision Rule Approximations for Stochastic Programming via Liftings

Stochastic programming provides a versatile framework for decision-making under uncertainty, but the resulting optimization problems can be computationally demanding. It has recently been shown that, primal and dual linear decision rule approximations can yield tractable upper and lower bounds on the optimal value of a stochastic program. Unfortunately, linear decision rules often provide crude approximations that result in loose bounds. To address this problem, we propose a lifting technique that maps a given stochastic program to an equivalent problem on a higherdimensional probability space. We prove that solving the lifted problem in primal and dual linear decision rules provides tighter bounds than those obtained from applying linear decision rules to the original problem. We also show that there is a one-to-one correspondence between linear decision rules in the lifted problem and families of non-linear decision rules in the original problem. Finally, we identify structured liftings that give rise to highly flexible piecewise linear decision rules and assess their performance in the context of a stylized investment planning problem.

G-Brownian Motion as Rough Paths and Differential Equations Driven by G-Brownian Motion

The present paper is devoted to the study of sample paths of G-Brownian motion and stochastic differential equations (SDEs) driven by G-Brownian motion from the view of rough path theory. As the starting point, we show that quasi-surely, sample paths of G-Brownian motion can be enhanced to the second level in a canonical way so that they become geometric rough paths of roughness 2 < p < 3. This result enables us to introduce the notion of rough differential equations (RDEs) driven by G-Brownian motion in the pathwise sense under the general framework of rough paths. Next we establish the fundamental relation between SDEs and RDEs driven by G-Brownian motion. As an application, we introduce the notion of SDEs on a differentiable manifold driven by GBrownian motion and construct solutions from the RDE point of view by using pathwise localization technique. This is the starting point of introducing G-Brownian motion on a Riemannian manifold, based on the idea of Eells-Elworthy-Malliavin. The last part of this paper is devoted to such construction for a wide and interesting class of G-functions whose invariant group is the orthogonal group. We also develop the Euler-Maruyama approximation for SDEs driven by G-Brownian motion of independent interest