Sample average approximation method for stochastic complementarity problems with applications to supply chain supernetworks
Open Access
- 1 January 2011
- journal article
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 7 (2) , 317-345
Abstract
We consider a class of stochastic nonlinear complementarity problems. We propose a new reformulation of the stochastic complementarity problem, that is, a two-stage stochastic mathematical programming model reformulation. Based on this reformulation, we propose a smoothing-based sample average approximation method for stochastic complementarity problem and prove its convergence. As an application, a supply chain super-network equilibrium is modeled as a stochastic nonlinear complementarity problem and numerical results on the problem are reported.Keywords
This publication has 22 references indexed in Scilit:
- New restricted NCP functions and their applications to stochastic NCP and stochastic MPECOptimization, 2007
- Robust solution of monotone stochastic linear complementarity problemsMathematical Programming, 2007
- Stochastic $R_0$ Matrix Linear Complementarity ProblemsSIAM Journal on Optimization, 2007
- New reformulations for stochastic nonlinear complementarity problemsOptimization Methods and Software, 2006
- Convergence theory for nonconvex stochastic programming with an application to mixed logitMathematical Programming, 2006
- A Regularized Sample Average Approximation Method for Stochastic Mathematical Programs with Nonsmooth Equality ConstraintsSIAM Journal on Optimization, 2006
- Expected Residual Minimization Method for Stochastic Linear Complementarity ProblemsMathematics of Operations Research, 2005
- Supply chain networks, electronic commerce, and supply side and demand side riskEuropean Journal of Operational Research, 2005
- A supply chain network equilibrium model with random demandsEuropean Journal of Operational Research, 2004
- Sample-path solution of stochastic variational inequalitiesMathematical Programming, 1999