Stochastic mathematical programs with probabilistic complementarity constraints: SAA and distributionally robust approaches
DOI10.1007/s10589-021-00292-5zbMath1473.90100OpenAlexW3174732929MaRDI QIDQ2044575
Publication date: 9 August 2021
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-021-00292-5
stochastic programmingcomplementarity problemsample average approximationchance constraintdistributionally robust
Convex programming (90C25) Stochastic programming (90C15) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chance-constrained problems and rare events: an importance sampling approach
- An integer programming approach for linear programs with probabilistic constraints
- Sample average approximation method for chance constrained programming: Theory and applications
- Data-driven robust chance constrained problems: a mixture model approach
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Distributionally robust joint chance constraints with second-order moment information
- Notes on some constraint qualifications for mathematical programs with equilibrium constraints
- Data-driven stochastic programming with distributionally robust constraints under Wasserstein distance: asymptotic properties
- Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation
- Discrete approximation of two-stage stochastic and distributionally robust linear complementarity problems
- A distributionally robust perspective on uncertainty quantification and chance constrained programming
- On distributionally robust chance-constrained linear programs
- Fourier-Motzkin elimination and its dual
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- Chance-Constrained Programming
- Distributionally Robust Stochastic Knapsack Problem
- Distributionally Robust Convex Optimization
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization
- Sequential Convex Approximations to Joint Chance Constrained Programs: A Monte Carlo Approach
- SAMPLE AVERAGE APPROXIMATION METHODS FOR A CLASS OF STOCHASTIC VARIATIONAL INEQUALITY PROBLEMS
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- Solving an Electricity Generating Capacity Expansion Planning Problem by Generalized Benders' Decomposition
- Variational Analysis
- Ambiguous Joint Chance Constraints Under Mean and Dispersion Information
- Convergence Analysis of Sample Average Approximation of Two-Stage Stochastic Generalized Equations
- On Deterministic Reformulations of Distributionally Robust Joint Chance Constrained Optimization Problems
- Probability Inequalities for Sums of Bounded Random Variables
- Solving Stochastic Mathematical Programs with Complementarity Constraints Using Simulation
- Convex Approximations of Chance Constrained Programs
- Mathematical Programs with Equilibrium Constraints
- Distributionally robust chance constraints for non-linear uncertainties
This page was built for publication: Stochastic mathematical programs with probabilistic complementarity constraints: SAA and distributionally robust approaches