Variational Inequalities in Vector Optimization

  • G. P. Crespi
  • I. Ginchev
  • M. Rocca
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 79)


In this paper we investigate the links among generalized scalar variational inequalities of differential type, vector variational inequalities and vector optimization problems. The considered scalar variational inequalities are obtained through a nonlinear scalarization by means of the so called “oriented distance” function [14,15].

In the case of Stampacchia-type variational inequalities, the solutions of the proposed ones coincide with the solutions of the vector variational inequalities introduced by Giannessi [8]. For Minty-type variational inequalities, analogous coincidence happens under convexity hypotheses. Furthermore, the considered variational inequalities reveal useful in filling a gap between scalar and vector variational inequalities. Namely, in the scalar case Minty variational inequalities of differential type represent a sufficient optimality condition without additional assumptions, while in the vector case the convexity hypothesis is needed. Moreover it is shown that vector functions admitting a solution of the proposed Minty variational inequality enjoy some well-posedness properties, analogously to the scalar case [4].


Variational Inequality Strong Solution Vector Optimization Vector Optimization Problem Vector Variational Inequality 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Blum E., Oettli W.: From optimization and variational inequalities to equilibrium problems. Math. Student 63, no. 1–4, 123–145, 1994.zbMATHMathSciNetGoogle Scholar
  2. [2]
    Crespi G.P.: Proper efficiency and vector variational inequalities, Journal of Information and Optimization Sciences, Vol. 23, No. 1, pp. 49–62, 2002.zbMATHMathSciNetGoogle Scholar
  3. [3]
    Crespi G.P., Guerraggio A., Rocca, M.: Minty variational inequality and optimization: scalar and vector case, to appear in the Proceedings of the VII Symposium on Generalized Convexity-Monotonicity, Hanoi, Vietnam, August 2002.Google Scholar
  4. [4]
    Crespi G.P., Ginchev I., Rocca M.: Existence of solutions and star-shapedness in Minty variational inequality. J. Global Optim., to appear.Google Scholar
  5. [5]
    Demyanov V.F., Rubinov A.M.: Constructive Nonsmooth Analysis, Peter Lang, Frankfurt am Main, 1995.zbMATHGoogle Scholar
  6. [6]
    Dentcheva D., Helbig, S.: On variational principles, level sets, well-posedness, and ɛ-solutions in vector optimization. J. Optim. Theory Appl. 89, no. 2, 325–349, 1996.zbMATHCrossRefMathSciNetGoogle Scholar
  7. [7]
    Dontchev A.L., Zolezzi T.: Well-posed optimization problems, Springer, Berlin, 1993.zbMATHGoogle Scholar
  8. [8]
    Giannessi, F.: Theorems of the alternative, quadratic programs and complementarity problems, in Variational Inequalities and Complementarity Problems. Theory and applications (R.W. Cottle, F. Giannessi, J.L. Lions eds.), Wiley, New York, pp. 151–186, 1980.Google Scholar
  9. [9]
    Giannessi F.: On Minty variational principle, in New Trends in Mathematical Programming, Kluwer, Dordrecht pp. 93–99, 1997.Google Scholar
  10. [10]
    Giannessi F.: On a connection among separation, penalization and regularization for variational inequalities with point to set operators. Rend. Circ. Mat. Palermo (2) Suppl. No. 48, 137–145,1997.MathSciNetGoogle Scholar
  11. [11]
    Ginchev I., Guerraggio A., Rocca M.: From scalar to vector optimization. Appl. Math., to appear.Google Scholar
  12. [12]
    Ginchev I, Hoffman A.: Approximation of set-valued functioons by single-valued ones. Discuss. Math. Differ. Incl. Control Optim. 22, no. 1, 33–66, 2002.zbMATHMathSciNetGoogle Scholar
  13. [13]
    Kinderlehrer, D., Stampacchia, G. An introduction to variational inequalities and their applications, Academic Press, New York, 1980.zbMATHGoogle Scholar
  14. [14]
    Hiriart-Urruty J.-B.: New concepts in nondifferentiable programming. Analyse non convexe, Bull. Soc. Math. France 60, 57–85, 1979.MathSciNetGoogle Scholar
  15. [15]
    Hiriart-Urruty J.-B.: Tangent cones, generalized gradients and mathematical programming in Banach spaces. Math. Oper. Res. 4, 79–97, 1979.zbMATHMathSciNetCrossRefGoogle Scholar
  16. [16]
    Lee G.M., Kim D.S., Lee B.S., Yen N.D.: Vector variational inequalities as a tool for studying vector optimization problems. Nonlinear Anal. 34, 745–765, 1998.zbMATHCrossRefMathSciNetGoogle Scholar
  17. [17]
    Minty, G.J.: On the generalization of a direct method of the calculus of variations, Bulletin of American Mathematical Society, Vol. 73, pp. 314–321, 1967.MathSciNetGoogle Scholar
  18. [18]
    Rubinov, A.M.: Abstract convexity and global optimization, Kluwer, Dordrecht, 2000.zbMATHGoogle Scholar
  19. [19]
    Sawaragi, Y., Nakayama, H., Tanino, T.: Theory of multiobjective optimization. Mathematics in Science and Engineering, 176. Academic Press, Inc., Orlando, FL, 1985.zbMATHGoogle Scholar
  20. [20]
    Zaffaroni A.: Degrees of efficiency and degrees of minimality. SIAM J. Optimization, to appear.Google Scholar

Copyright information

© Springer Science+Business Media, Inc. 2005

Authors and Affiliations

  • G. P. Crespi
    • 1
  • I. Ginchev
    • 2
  • M. Rocca
    • 3
  1. 1.Faculty of EconomicsUniversity of Valle d’AostaAostaItaly
  2. 2.Dept. of MathematicsTechnical University of VarnaVarnaBulgaria
  3. 3.Dept. of EconomicsUniversity of InsubriaVareseItaly

Personalised recommendations