×

zbMATH — the first resource for mathematics

Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization. (English) Zbl 1168.90008
The authors consider the stochastic mathematical programs with linear complementarity constraints, which include two kinds of models: the old one, so-called lower-level wait-and-see model, and the new model called here-and-now. They study mainly the following here-and-now model:
\[ \begin{aligned} &\underset{x,y,z}{\text{minimize}}\;E_\omega[f(x,y,\omega)+d^Tz(\omega)]\\ &\text{subject to}\quad x\in X,\quad y\geq 0,\quad F(x,y,\omega)+z(\omega)\geq 0,\\ &y^T(F(x,y,\omega)+z(\omega))=0,\quad z(\omega)\geq 0,\quad \omega\in\Omega\;\text{a.e.} \end{aligned} \]
Here the mapping \(F\) is affine, \(d\) is a vector with positive elements, \(\omega\) is a discrete or continuous random variable; and the rest of the notations are conventional ones. The continuous problem is discretized by a quasi-Monte Carlo method.
The authors present a combined smoothing implicit programming and penalty method with appropriate convergence results. The numerical results (for a picnic vender decision problem) are also present.

MSC:
90C15 Stochastic programming
90C33 Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
90C30 Nonlinear programming
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Anitescu M. (2005). On using the elastic mode in nonlinear programming approaches to mathematical programs with complementarity constraints. SIAM J. Optim. 15: 1203–1236 · Zbl 1097.90050
[2] Bertsekas D.P. (1982). Constrained Optimization and Lagrange Multiplier Methods. Academic Press, New York · Zbl 0572.90067
[3] Birbil S.I., Gürkan G. and Listes O. (2006). Solving stochastic mathematical programs with complementarity constraints using simulation. Math. Oper. Res. 31: 739–760 · Zbl 1278.90278
[4] Birge J.R. and Louveaux F. (1997). Introduction to Stochastic Programming. Springer, New York · Zbl 0892.90142
[5] Chen X. and Fukushima M. (2004). A smoothing method for a mathematical program with P-matrix linear complementarity constraints. Comput. Optim. Appl. 27: 223–246 · Zbl 1046.90086
[6] Chen Y. and Florian M. (1995). The nonlinear bilevel programming problem: formulations, regularity and optimality conditions. Optimization 32: 193–209 · Zbl 0812.00045
[7] Cottle R.W., Pang J.S. and Stone R.E. (1992). The Linear Complementarity Problem. Academic, New York · Zbl 0757.90078
[8] Facchinei F., Jiang H. and Qi L. (1999). A smoothing method for mathematical programs with equilibrium constraints. Math. Program. 85: 107–134 · Zbl 0959.65079
[9] Facchinei F. and Pang J.S. (2003). Finite-Dimensional Variational Inequalities and Complementarity Problems, Part I. Springer, New York · Zbl 1062.90001
[10] Fischer A. (1992). A special Newton-type optimization method. Optimization 24: 269–284 · Zbl 0814.65063
[11] Fletcher R., Leyffer S., Ralph D. and Scholtes S. (2006). Local convergence of SQP methods for mathematical programs with equilibrium constraints. SIAM J. Optim. 17: 259–286 · Zbl 1112.90098
[12] Fukushima, M., Lin, G.H.: Smoothing methods for mathematical programs with equilibrium constraints. In: Proceedings of the ICKS’04, pp. 206–213. IEEE Computer Society (2004)
[13] Fukushima M., Luo Z.Q. and Pang J.S. (1998). A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints. Comput. Optim. Appl. 10: 5–34 · Zbl 0904.90153
[14] Fukushima M. and Pang J.S. (1999). Convergence of a smoothing continuation method for mathematical problems with complementarity constraints. Ill-posed Variational Problems and Regularization Techniques. In: Théra, M. and Tichatschke, R. (eds) Lecture Notes in Economics and Mathematical Systems. vol. 477, pp 105–116. Springer, Heidelberg
[15] Hu X. and Ralph D. (2004). Convergence of a penalty method for mathematical programming with equilibrium constraints. J. Optim. Theory Appl. 123: 365–390
[16] Jiang H. and Ralph D. (2000). Smooth SQP methods for mathematical programs with nonlinear complementarity constraints. SIAM J. Optim. 10: 779–808 · Zbl 0955.90134
[17] Kall P. and Wallace S.W. (1994). Stochastic Programming. Wiley, Chichester
[18] Lin, G.H., Chen, X., Fukushima, M.: Smoothing implicit programming approaches for stochastic mathematical programs with linear complementarity constraints. Technical Report 2003-006. Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Kyoto, Japan (2003)
[19] Lin G.H. and Fukushima M. (2005). A class of stochastic mathematical programs with complementarity constraints: Reformulations and algorithms. J. Ind. Manag. Optim. 1: 99–122 · Zbl 1096.90024
[20] Lin G.H. and Fukushima M. (2005). A modified relaxation scheme for mathematical programs with complementarity constraints. Ann. Oper. Res. 133: 63–84 · Zbl 1119.90058
[21] Lin G.H. and Fukushima M. (2006). Hybrid algorithms with active set identification for mathematical programs with complementarity constraints. J. Optim. Theory Appl. 128: 1–28 · Zbl 1130.90047
[22] Lin G.H. and Fukushima M. (2003). New relaxation method for mathematical programs with complementarity constraints. J. Optim. Theory Appl. 118: 81–116 · Zbl 1033.90086
[23] Lin G.H. and Fukushima M. (2005). Regularization method for stochastic mathematical programs with complementarity constraints. Eur. Ser. Appl. Ind. Math. Control Optim. Calculus Var. 11: 252–265 · Zbl 1080.90055
[24] Luo Z.Q., Pang J.S. and Ralph D. (1996). Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge · Zbl 0870.90092
[25] Niederreiter H. (1992). Random Number Generation and Quasi-Monte Carlo Methods. SIAM, Philadelphia · Zbl 0761.65002
[26] Outrata J.V., Kocvara M. and Zowe J. (1998). Nonsmooth Approach to Optimization Problems with Equilibrium Constraints: Theory, Applications and Numerical Results. Kluwer, Boston · Zbl 0947.90093
[27] Patriksson M. and Wynter L. (1999). Stochastic mathematical programs with equilibrium constraints. Oper. Res. Lett. 25: 159–167 · Zbl 0937.90076
[28] Scheel H.S. and Scholtes S. (2000). Mathematical programs with complementarity constraints: Stationarity, optimality and sensitivity. Math. Oper. Res. 25: 1–22 · Zbl 1073.90557
[29] Scholtes S. (2001). Convergence properties of a regularization scheme for mathematical programs with complementarity constraints. SIAM J. Optim. 11: 918–936 · Zbl 1010.90086
[30] Shapiro A. (2006). Stochastic programming with equilibrium constraints. J. Optim. Theory Appl. 128: 221–243 · Zbl 1130.90032
[31] Shapiro, A., Xu, H.: Stochastic mathematical programs with equilibrium constraints. modeling and sample average approximation. School of Industrial and System Engineering, Georgia Institute of Technology, Antalanta, Georgia, USA (2005)
[32] Vajda S. (1972). Probabilistic Programming. Academic, New York
[33] Xu H. (2006). An implicit programming approach for a class of stochastic mathematical programs with linear complementarity constraints. SIAM J. Optim. 16: 670–696 · Zbl 1113.90114
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.