Computational Optimization and Applications

, Volume 53, Issue 2, pp 485–503 | Cite as

Approximate values for mathematical programs with variational inequality constraints



In general the infimal value of a mathematical program with variational inequality constraints (MPVI) is not stable under perturbations in the sense that the sequence of infimal values for the perturbed programs may not converge to the infimal value of the original problem even in presence of nice data. Thus, for these programs we consider different types of values which approximate the exact value from below or/and from above under or without perturbations.


Mathematical program Bilevel problem Variational inequality Infimal value Approximate solution Perturbation 



The authors thanks the Referees and the Editor in charge for their stimulating suggestions that helped to improve the paper.


  1. 1.
    Attouch, H.: Variational Convergence for Functions and Operators. Applicable Mathematics Series. Pitman, Boston (1984). Advanced Publishing Program MATHGoogle Scholar
  2. 2.
    Aubin, J.P., Frankowska, A.: Set-Valued Analysis. Birkhauser Boston, Boston (1990). MATHGoogle Scholar
  3. 3.
    Baiocchi, C., Capelo, A.: Variational and Quasivariational Inequalities, Applications to Free Boundary Problems. Wiley, New York (1984) MATHGoogle Scholar
  4. 4.
    Bank, B., Guddat, J., Kummer, B., Tammer, K.: Non-linear Parametric Optimization. Academic Press, Berlin (1982) Google Scholar
  5. 5.
    Basar, T., Olsder, G.J.: Dynamic Noncooperative Game Theory. Academic Press, London (1982) MATHGoogle Scholar
  6. 6.
    Chen, G.Y., Li, S.J., Teo, K.L.: On the stability of generalized vector quasivariational inequality problems. J. Optim. Theory Appl. 113, 283–295 (2002) MathSciNetMATHCrossRefGoogle Scholar
  7. 7.
    Colson, B., Marcotte, P., Savard, G.: An overview of bilevel optimization. Ann. Oper. Res. 153, 235–256 (2007) MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    Del Prete, I., Lignola, M.B., Morgan, J.: New concepts of well-posedness for optimization problems with variational inequality constraints. J. Inequal. Pure Appl. Math. 4(1), 5 (2003) MathSciNetGoogle Scholar
  9. 9.
    Dempe, S.: First-order necessary optimality conditions for general bilevel programming problems. J. Optim. Theory Appl. 95(3), 735–739 (1997) MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    Dempe, S.: Foundations of Bilevel Programming. Springer, Berlin (2002) MATHGoogle Scholar
  11. 11.
    Drouet, L., Haurie, A., Moresino, F., Vial, J.-Ph., Vielle, M., Viguier, L.: An oracle based method to compute a coupled equilibrium in a model of international climate policy. Comput. Manag. Sci. 5(1–2), 119–140 (2008) MathSciNetMATHCrossRefGoogle Scholar
  12. 12.
    Facchinei, F., Pang, J.S.: Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer Series in Operations Research, XXXII, vols. I and II. Springer, Berlin (2003) Google Scholar
  13. 13.
    Fang, Y.P., Hu, R., Huang, N.J.: Well-posedness for equilibrium problems and for optimization problems with equilibrium constraints. Comput. Math. Appl. 55(1), 89–100 (2008) MathSciNetMATHCrossRefGoogle Scholar
  14. 14.
    Fukushima, M., Pang, J.S.: Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games. Comput. Manag. Sci. 2(1), 21–56 (2005) MathSciNetMATHCrossRefGoogle Scholar
  15. 15.
    Giannessi: On Minty Variational Inequalities, New Trends in Mathematical Programming. Applied Optimization, vol. 13, pp. 93–99. Kluwer Academic, Boston (1998) Google Scholar
  16. 16.
    Harker, P.T., Pang, J.S.: Finite-dimensional variational inequality and nonlinear complementarity problems: a survey of theory, algorithms and application. Math. Program. 48, 161–220 (1990) MathSciNetMATHCrossRefGoogle Scholar
  17. 17.
    Karamardian, S., Schaible, S.: Seven kinds of generalized monotone maps. J. Optim. Theory Appl. 66, 37–46 (1990) MathSciNetMATHCrossRefGoogle Scholar
  18. 18.
    Lignola, M.B.: Well-posedness and L-well-posedness for quasi-variational inequalities. J. Optim. Theory Appl. 128(1), 119–138 (2006) MathSciNetMATHCrossRefGoogle Scholar
  19. 19.
    Lignola, M.B., Morgan, J.: Semicontinuity and episemicontinuity: equivalence and applications. Boll. Unione Mat. Ital. 8-B, 1–16 (1994) Google Scholar
  20. 20.
    Lignola, M.B., Morgan, J.: Approximate solutions to variational inequalities and applications. Le Matematiche 49, 281–293 (1994) MathSciNetMATHGoogle Scholar
  21. 21.
    Lignola, M.B., Morgan, J.: Topological existence and stability for Stackelberg problems. J. Optim. Theory Appl. 84, 145–169 (1995) MathSciNetMATHCrossRefGoogle Scholar
  22. 22.
    Loridan, P., Morgan, J.: Weak via strong Stackelberg problem: new results. J. Glob. Optim. 8, 263–287 (1996) MathSciNetMATHCrossRefGoogle Scholar
  23. 23.
    Lignola, M.B., Morgan, J.: Stability of regularized bilevel programming problems. J. Optim. Theory Appl. 93, 575–596 (1997) MathSciNetMATHCrossRefGoogle Scholar
  24. 24.
    Lignola, M.B., Morgan, J.: Well-posedness for optimization problems with constraints defined by variational inequalities having a unique solution. J. Glob. Optim. 16(1), 57–67 (2000) MathSciNetMATHCrossRefGoogle Scholar
  25. 25.
    Lignola, M.B., Morgan, J.: Existence of solutions to bilevel variational problems in Banach spaces. In: Giannessi, F., Maugeri, A., Pardalos, P.M. (eds.) Equilibrium Problems and Variational Models. Kluwer Academic, Norwell (2004) Google Scholar
  26. 26.
    Lignola, M.B., Morgan, J.: Alpha-well-posedness for Nash equilibria and for optimization problems with Nash equilibrium constraints. J. Glob. Optim. 36(3), 439–459 (2006) MathSciNetMATHCrossRefGoogle Scholar
  27. 27.
    Lignola, M.B., Morgan, J.: Convergence results for weak efficiency in vector optimization problems with equilibrium constraints. J. Optim. Theory Appl. 133(1), 117–121 (2007) MathSciNetMATHCrossRefGoogle Scholar
  28. 28.
    Loridan, P., Morgan, J.: A theoretical approximation scheme for Stackelberg problems. J. Optim. Theory Appl. 61, 95–110 (1989) MathSciNetMATHCrossRefGoogle Scholar
  29. 29.
    Luo, Z.-Q., Pang, J.-S., Ralph, D.: Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge (1996) CrossRefGoogle Scholar
  30. 30.
    Minty, G.J.: Monotone (non linear) operators in Hilbert space. Duke Math. J. 29, 341–346 (1962) MathSciNetMATHCrossRefGoogle Scholar
  31. 31.
    Morgan, J.: Constrained well-posed two-level optimization problems. In: Clarke, F., Demianov, V., Giannessi, F. (eds.) Nonsmooth Optimization and Related Topics. Ettore Majorana International Sciences Series, pp. 307–326. Plenum, New York (1989) Google Scholar
  32. 32.
    Morgan, J., Raucci, R.: New convergence results for Nash equilibria. J. Convex Anal. 6, 377–385 (1999) MathSciNetMATHGoogle Scholar
  33. 33.
    Nesterov, Y., Nemirovskii, A.: Interior-point Polynomial Algorithms in Convex Programming. SIAM Studies in Applied Mathematics, vol. 13. SIAM, Philadelphia (1994) MATHCrossRefGoogle Scholar
  34. 34.
    Revalski, J.: Variational inequalities with unique solution. In: Mathematics and Education in Mathematics, Proceedings of the 14th Spring Conference of the Union of Bulgarian Mathematicians, Sofia (1985) Google Scholar
  35. 35.
    Wu, Y.N., Cheng, T.C.E.: Convergence results for weak efficiency in vector optimization problems with equilibrium constraints. J. Optim. Theory Appl. 125, 453–472 (2005) MathSciNetMATHCrossRefGoogle Scholar
  36. 36.
    Ye, J.J., Zhu, D.L.: Optimality conditions for bilevel programming problems. Optimization 33(1), 9–27 (1995) MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  1. 1.Dipartimento di Matematica e Applicazioni R. CaccioppoliUniversità di Napoli Federico IINapoliItaly
  2. 2.Dipartimento di Matematica e Statistica & CSEFUniversità di Napoli Federico IINapoliItaly

Personalised recommendations