Variational inequalities in vector optimization
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 was 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].
Year of publication: |
2004-10
|
---|---|
Authors: | Crespi Giovanni P. ; Ivan, Ginchev ; Matteo, Rocca |
Institutions: | Facoltà di Economia, Università degli Studi dell'Insubria |
Saved in:
Saved in favorites
Similar items by person
-
Increase-along-rays property for vector functions
Crespi Giovanni P., (2004)
-
First order optimality condition for constrained set-valued optimization
Crespi Giovanni P., (2004)
-
First order optimality conditions in set-valued optimization
Crespi Giovanni P., (2004)
- More ...