-

 

 

 




Optimization Online





 

Necessary Optimality Conditions for two-stage Stochastic Programs with Equilibrium Constraints

Huifu Xu (h.xu***at***soton.ac.uk)
Jane J. Ye (janeye***at***uvic.ca)

Abstract: Developing first order optimality conditions for a two-stage stochastic mathematical program with equilibrium constraints (SMPEC) whose second stage problem has multiple equilibria/solutions is a challenging undone work. In this paper we take this challenge by considering a general class of two-stage whose equilibrium constraints are represented by a parametric variational inequality (where the first stage decision vector and a random vector are treated as parameters). We use the sensitivity analysis on deterministic MPECs as a tool to deal with the challenge: First, we extend a well-known theorem in nonsmooth analysis about the exchange of subdifferential operator with Aumann's integration from a nonatomic probability space to a general setting; second, we apply the extended result together with the existing sensitivity analysis results on the value function of the deterministic MPEC and the bilevel programming to the value function of our second stage problem; third, we develop various optimality conditions in terms of the subdifferential of the value function of the second stage problem and its relaxations which are constructed through the gradients of the underlying function at the second stage; finally we analyze special cases when the variational inequality constraint reduces to a complementarity problem and further to a system of nonlinear equalities and inequalities. The subdifferential to be used in this paper is the limiting (Mordukovich) subdifferential and the probability space is not necessarily nonatomic which means that the Aumann's integral of the limiting subdifferential of a random function may be strictly smaller than that of the Clarke's.

Keywords: SMPECs, first order necessary conditions, limiting subdifferentials, M-stationary points, random set-valued mappings, sensitivity analysis

Category 1: Stochastic Programming

Category 2: Convex and Nonsmooth Optimization (Nonsmooth Optimization )

Category 3: Complementarity and Variational Inequalities

Citation:

Download: [Postscript][PDF]

Entry Submitted: 09/18/2009
Entry Accepted: 09/18/2009
Entry Last Modified: 09/18/2009

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society