Advertisement

On Constraint Qualifications for Mathematical Programs with Mixed Complementarity Constraints

  • J. V. Outrata
Part of the Applied Optimization book series (APOP, volume 50)

Abstract

The contribution concerns mathematical programs, where a mixed complementarity problem arises as a side constraint. The attention is paid above all to optimality conditions and to the respective constraint qualifications. In addition, we propose an exact penalty approach to the numerical solution of such problems.

Keywords

Mathematical Program Constraint Qualification Equilibrium Constraint Exact Penalization Complementarity Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Aubin, J.-P. and Frankowska H. (1990). Set-Valued Analysis. Birkhäuser, Boston.zbMATHGoogle Scholar
  2. [2]
    Harker, P.T. and Choi, S.C. (1987). A penalty function approach to mathematical programs with variational inequality constraints. Technical report, Decision Sciences Department, University of Pennsylvania.Google Scholar
  3. [3]
    Kočvara M. and Outrata J.V. (1997). A nonsmooth approach to optimization problems with equilibrium constraints. In Ferris, M. and Pang, J.-S., editors. Complementarity and Variational Problems, pages 148–164, SIAM, Philadelphia.Google Scholar
  4. [4]
    Kuntz L. and Scholtes S. (1995). A nonsmooth variant of the Man-gasarian — Promovitz constraint qualification. J. Optimization Theory and Applications, 82: 59–75.MathSciNetCrossRefGoogle Scholar
  5. [5]
    Luo, Z.-Q., Pang, J.-S., and Ralph, D. (1996). Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge.CrossRefGoogle Scholar
  6. [6]
    Mordukhovich, B.S. (1988). Approximation Methods in Problems of Optimization and Control. Nauka, Moscow. (In Russian; English edition to appear in Wiley — Interscience.)zbMATHGoogle Scholar
  7. [7]
    Mordukhovich, B.S. (1994). Generalized differential calculus for nonsmooth and set-valued mappings. J. Math. Analysis and Applications, 183: 250–288.MathSciNetzbMATHCrossRefGoogle Scholar
  8. [8]
    Murphy, F.H., Sherali, H.D., and Soyster, A.L. (1982). A mathematical programming approach for determining oligopolistic market equilibrium. Mathematical Programming, 24: 92–106.MathSciNetzbMATHCrossRefGoogle Scholar
  9. [9]
    Outrata, J. V. (1999). Optimality conditions for a class of mathematical programs with equilibrium constraints. Mathematics of Operations Research, 24, 627–644.MathSciNetzbMATHCrossRefGoogle Scholar
  10. [10]
    Outrata, J. V. (1999). On mathematical programs with complementarity constraints. Accepted in J. of Optimization Methods and Software.Google Scholar
  11. [11]
    Outrata, J.V. (2000). A generalized mathematical program with equilibrium constraints. SIAM J. on Control and Optimization, 38: 1623–1638.MathSciNetzbMATHCrossRefGoogle Scholar
  12. [12]
    Outrata, J.V. and Zowe, J. (1995). A numerical approach to optimization problems with variational inequality constraints. Mathematical Programming, 68: 105–130.MathSciNetzbMATHGoogle Scholar
  13. [13]
    Pang, J.-S. and Fukushima, M. (1999). Complementarity constraint qualifications and simplified B-stationarity conditions for mathematical programs with equilibrium constraints. Computational Optimization and Applications, 13: 111–136.MathSciNetzbMATHCrossRefGoogle Scholar
  14. [14]
    Robinson, S.M. (1980). Strongly regular generalized equations. Mathematics of Operations Research, 5: 43–62.MathSciNetzbMATHCrossRefGoogle Scholar
  15. [15]
    Scholtes, S. and Stöhr, M. (1999). Exact penalization of mathematical programs with equilibrium constraints. SIAM J. on Control and Optimization, 37: 617–652.zbMATHCrossRefGoogle Scholar
  16. [16]
    Schramm, H. and Zowe, J. (1992). A version of the bundle idea for minimizing a nonsmooth function: conceptual idea, convergence analysis, numerical results. SIAM J. on Optimization, 2: 121–152.MathSciNetzbMATHCrossRefGoogle Scholar
  17. [17]
    Ye, J.J. (1999). Optimality conditions for optimization problems with complementarity constraints. SIAM J. on Optimization, 9: 374–387.zbMATHCrossRefGoogle Scholar
  18. [18]
    Ye, J.J. (2000). Constraint qualifications and necessary optimality conditions for optimization problems with variational inequality constraints. SIAM J. on Optimization, 10: 943–962.zbMATHCrossRefGoogle Scholar
  19. [19]
    Ye, J.J. and Ye, X.Y. (1997). Necessary optimality conditions for optimization problems with variational inequality constraints. Mathematics of Operations Research, 22: 977–997.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2001

Authors and Affiliations

  • J. V. Outrata
    • 1
  1. 1.Institute of Information Theory and AutomationAcademy of Sciences of the Czech RepublicPragueCzech Republic

Personalised recommendations