Convexity and optimization with copulæ structured probabilistic constraints. (2nd July 2016)

• Record Type: Journal Article
• Authors: van Ackooij, W.; de Oliveira, W.
• Is Part Of: Optimization. Volume 65:Number 7(2016)
• Page Start: 1349
• Page End: 1376
• Publication Date: 2016-07-02
• Subjects: Chance constrained programming -- copulæ -- joint chance constraints -- second-order conic programming -- convexity -- probabilistic constraints; 49M37 -- 52A30 -- 65K05 -- 90C15; Mathematical optimization -- Periodicals; 519.7
• DOI: 10.1080/02331934.2016.1179302
• Languages: English
• ISSNs: 0233-1934

Abstract

Abstract : Probability constraints play a key role in optimization problems involving uncertainties. These constraints request that an inequality system depending on a random vector has to be satisfied with a high enough probability. In specific settings, copulæ can be used to model the probabilistic constraints with uncertainty on the left-hand side. In this paper, we provide eventual convexity results for the feasible set of decisions under local generalized concavity properties of the constraint mappings and involved copulæ. The results cover all Archimedean copulæ. We consider probabilistic constraints wherein the decision and random vector are separated, i.e. left/right-hand side uncertainty. In order to solve the underlying optimization problem, we propose and analyse convergence of a regularized supporting hyperplane method: a stabilized variant of generalized Benders decomposition. The algorithm is tested on a large set of instances involving several copulæ among which the Gaussian copula. A Numerical comparison with a (pure) supporting hyperplane algorithm and a general purpose solver for non-linear optimization is also presented.