Study of M-stationarity and strong stationarity for a class of SMPCC problems via SAA method

DOI10.1016/j.orl.2016.04.001zbMath1380.90265OpenAlexW2326372331MaRDI QIDQ1694763

Arnab Sur

Publication date: 6 February 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2016.04.001

zbMATH Keywords

constraint qualificationssample average approximation (SAA) methodstochastic mathematical programming problem with complementarity constraints (SMPCC)strong and M-stationarity

Mathematics Subject Classification ID

Stochastic programming (90C15) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Unnamed Item
• Unnamed Item
• Stability analysis of one stage stochastic mathematical programs with complementarity constraints
• Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
• On the existence of solutions to stochastic mathematical programs with equilibrium constraints
• On \(M\)-stationary points for a stochastic equilibrium problem under equilibrium constraints in electricity spot market modeling.
• Sample-path solution of stochastic variational inequalities
• Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
• Stochastic mathematical programs with equilibrium constraints
• Stochastic programming with equilibrium constraints
• The Sample Average Approximation Method for Stochastic Discrete Optimization
• Convergence of Stationary Points of Sample Average Two-Stage Stochastic Programs: A Generalized Equation Approach
• Necessary Optimality Conditions for Two-Stage Stochastic Programs with Equilibrium Constraints
• Constraint Qualifications and Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
• Analysis of Sample-Path Optimization
• A Fritz John Approach to First Order Optimality Conditions for Mathematical Programs with Equilibrium Constraints
• The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited
• Solving Stochastic Mathematical Programs with Complementarity Constraints Using Simulation

This page was built for publication: Study of M-stationarity and strong stationarity for a class of SMPCC problems via SAA method