Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities

نویسندگان

  • Miguel A. Lejeune
  • François Margot
چکیده

We study a complex class of stochastic programming problems involving a joint chance constraint with random technology matrix and stochastic quadratic inequalities. We present a basic mixedinteger nonlinear reformulation based on Boolean modeling and derive several variants of it. We present detailed empirical results comparing the various reformulations and several easy to implement algorithmic ideas that improve performances of the mixed-integer nonlinear solver Couenne for solving these problems. Guidelines on how to tune the solver and selecting reformulations are presented. The test instances are epidemiology and disaster management facility location models and cover the three types of stochastic quadratic inequalities, namely product of two variables that are (i) both binary, (ii) binary and continuous, or (iii) both continuous.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geometric Programming with Stochastic Parameter

Geometric programming is efficient tool for solving a variety of nonlinear optimizationproblems. Geometric programming is generalized for solving engineering design. However,Now Geometric programming is powerful tool for optimization problems where decisionvariables have exponential form.The geometric programming method has been applied with known parameters. However,the observed values of the ...

متن کامل

Solving Chance-Constrained Stochastic Programs via Sampling and Integer Programming

Various applications in reliability and risk management give rise to optimization problems with constraints involving random parameters, which are required to be satisfied with a pre-specified probability threshold. There are two main difficulties with such chance-constrained problems. First, checking feasibility of a given candidate solution exactly is, in general, impossible since this requir...

متن کامل

Robust solutions to box-constrained stochastic linear variational inequality problem

We present a new method for solving the box-constrained stochastic linear variational inequality problem with three special types of uncertainty sets. Most previous methods, such as the expected value and expected residual minimization, need the probability distribution information of the stochastic variables. In contrast, we give the robust reformulation and reformulate the problem as a quadra...

متن کامل

Moment inequalities for sums of random matrices and their applications in optimization

In this paper, we consider various moment inequalities for sums of random matrices—which are well–studied in the functional analysis and probability theory literature—and demonstrate how they can be used to obtain the best known performance guarantees for several problems in optimization. First, we show that the validity of a recent conjecture of Nemirovski is actually a direct consequence of t...

متن کامل

Stochastic Approach to Vehicle Routing Problem: Development and Theories

Stochastic Approach to Vehicle Routing Problem: Development and Theories Abstract In this article, a chance constrained (CCP) formulation of the Vehicle Routing Problem (VRP) is proposed. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable computer software...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Operations Research

دوره 64  شماره 

صفحات  -

تاریخ انتشار 2016