Skip to main content
Springer Nature Link
Log in

Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization

  • FULL LENGTH PAPER
  • Published:
Mathematical Programming Submit manuscript

Abstract

In this paper, we consider the stochastic mathematical programs with linear complementarity constraints, which include two kinds of models called here-and-now and lower-level wait-and-see problems. We present a combined smoothing implicit programming and penalty method for the problems with a finite sample space. Then, we suggest a quasi-Monte Carlo approximation method for solving a problem with continuous random variables. A comprehensive convergence theory is included as well. We further report numerical results with the so-called picnic vender decision problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

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

    Article  MATH  MathSciNet  Google Scholar 

  2. Bertsekas D.P. (1982). Constrained Optimization and Lagrange Multiplier Methods. Academic Press, New York

    MATH  Google Scholar 

  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

    Article  MATH  MathSciNet  Google Scholar 

  4. Birge J.R. and Louveaux F. (1997). Introduction to Stochastic Programming. Springer, New York

    MATH  Google Scholar 

  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

    Article  MATH  MathSciNet  Google Scholar 

  6. Chen Y. and Florian M. (1995). The nonlinear bilevel programming problem: formulations, regularity and optimality conditions. Optimization 32: 193–209

    Article  MATH  MathSciNet  Google Scholar 

  7. Cottle R.W., Pang J.S. and Stone R.E. (1992). The Linear Complementarity Problem. Academic, New York

    MATH  Google Scholar 

  8. Facchinei F., Jiang H. and Qi L. (1999). A smoothing method for mathematical programs with equilibrium constraints. Math. Program. 85: 107–134

    Article  MATH  MathSciNet  Google Scholar 

  9. Facchinei F. and Pang J.S. (2003). Finite-Dimensional Variational Inequalities and Complementarity Problems, Part I. Springer, New York

    Google Scholar 

  10. Fischer A. (1992). A special Newton-type optimization method. Optimization 24: 269–284

    Article  MATH  MathSciNet  Google Scholar 

  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

    Article  MATH  MathSciNet  Google Scholar 

  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

    Article  MATH  MathSciNet  Google Scholar 

  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

    Google Scholar 

  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

    Article  MathSciNet  Google Scholar 

  16. Jiang H. and Ralph D. (2000). Smooth SQP methods for mathematical programs with nonlinear complementarity constraints. SIAM J. Optim. 10: 779–808

    Article  MATH  MathSciNet  Google Scholar 

  17. Kall P. and Wallace S.W. (1994). Stochastic Programming. Wiley, Chichester

    MATH  Google Scholar 

  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

    MATH  MathSciNet  Google Scholar 

  20. Lin G.H. and Fukushima M. (2005). A modified relaxation scheme for mathematical programs with complementarity constraints. Ann. Oper. Res. 133: 63–84

    Article  MATH  MathSciNet  Google Scholar 

  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

    Article  MATH  MathSciNet  Google Scholar 

  22. Lin G.H. and Fukushima M. (2003). New relaxation method for mathematical programs with complementarity constraints. J. Optim. Theory Appl. 118: 81–116

    Article  MATH  MathSciNet  Google Scholar 

  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

    Article  MATH  MathSciNet  Google Scholar 

  24. Luo Z.Q., Pang J.S. and Ralph D. (1996). Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge

    Google Scholar 

  25. Niederreiter H. (1992). Random Number Generation and Quasi-Monte Carlo Methods. SIAM, Philadelphia

    MATH  Google Scholar 

  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

    MATH  Google Scholar 

  27. Patriksson M. and Wynter L. (1999). Stochastic mathematical programs with equilibrium constraints. Oper. Res. Lett. 25: 159–167

    Article  MATH  MathSciNet  Google Scholar 

  28. Scheel H.S. and Scholtes S. (2000). Mathematical programs with complementarity constraints: Stationarity, optimality and sensitivity. Math. Oper. Res. 25: 1–22

    Article  MATH  MathSciNet  Google Scholar 

  29. Scholtes S. (2001). Convergence properties of a regularization scheme for mathematical programs with complementarity constraints. SIAM J. Optim. 11: 918–936

    Article  MATH  MathSciNet  Google Scholar 

  30. Shapiro A. (2006). Stochastic programming with equilibrium constraints. J. Optim. Theory Appl. 128: 221–243

    Article  MATH  Google Scholar 

  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

    Google Scholar 

  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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Dalian University of Technology, Dalian, 116024, China

    Gui-Hua Lin

  2. Department of Mathematical System Science, Hirosaki University, Hirosaki, 036-8560, Japan

    Xiaojun Chen

  3. Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Kyoto, 606-8501, Japan

    Masao Fukushima

Authors
  1. Gui-Hua Lin
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Xiaojun Chen
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Masao Fukushima
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Masao Fukushima.

Additional information

This paper is dedicated to Professor Alfred Auslender on the occasion of his 65th birthday.

This work was supported in part by the Scientific Research Grant-in-Aid from Japan Society for the Promotion of Science.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lin, GH., Chen, X. & Fukushima, M. Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization. Math. Program. 116, 343–368 (2009). https://doi.org/10.1007/s10107-007-0119-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-007-0119-3

Keywords

Mathematics Subject Classification (2000)