Stochastic programming problems with generalized integrated chance constraints

Abstract

If the constraints in an optimization problem are dependent on a random parameter, we would like to ensure that they are fulfilled with a high level of reliability. The most natural way is to employ chance constraints. However, the resulting problem is very hard to solve. We propose an alternative formulation of stochastic programs using penalty functions. The expectations of penalties can be left as constraints leading to generalized integrated chance constraints, or incorporated into the objective as a penalty term. We show that the penalty problems are asymptotically equivalent under quite mild conditions. We discuss applications of sample-approximation techniques to the problems with generalized integrated chance constraints and propose rates of convergence for the set of feasible solutions. We will direct our attention to the case when the set of feasible solutions is finite, which can appear in integer programming. The results are then extended to the bounded sets with continuous variables. Additional binary variables are necessary to solve sample-approximated chance-constrained problems, leading to a large mixed-integer non-linear program. On the other hand, the problems with penalties can be solved without adding binary variables; just continuous variables are necessary to model the penalties. The introduced approaches are applied to the blending problem leading to comparably reliable solutions.

From Stochastic Dominance to Dea-Risk Models: Portfolio Efficiency Analysis

“…Finally, a comparison to mean-risk efficiency can be done similarly as in Kopa (2011). In future research, we will address sample approximation technique, see Branda (2012), to handle the tests with multivariate continuous distribution of asset returns.…”

Robot Dance: A mathematical optimization platform for intervention against COVID-19 in a complex network

“…(2017) . For other methodologies and solvers, we refer to Pflug and Pichler (2011) and Branda (2012) .…”

Exact Penalization in Stochastic Programming—Calmness and Constraint Qualification

“…It can be verified that under some conditions we obtain an optimal solution with desirable reliability by increasing the penalty parameter and solving the resulting problems. It can be even shown that under mild conditions the penalty approach and the chance constrained problem are asymptotically equivalent; see Branda [14,15], Branda and Dupačová [16], and Ermoliev et al [17]. Recently, the equivalence was stated under exact penalization where a finite penalty parameter is sufficient to obtain a local optimal solution which is permanently feasible with respect to the random constraints; see Branda [18].…”