Pareto reducibility of vector variational inequalities
A multicriteria optimization problem is called Pareto reducible if its weakly efficient solutions are Pareto solutions of the problem itself or a subproblem obtained from it by selecting certain criteria. The aim of this paper is to introduce a similar concept of Pareto reducibility for a class of vector variational inequalities. Key words: Vector variational inequality, Pareto reducibility. 2000 Mathematics Subject Classification: 49J40, 90C29.
Year of publication: |
2010-01
|
---|---|
Authors: | Popovici, Nicolae ; Rocca, Matteo |
Institutions: | Facoltà di Economia, Università degli Studi dell'Insubria |
Saved in:
freely available
Saved in favorites
Similar items by person
-
Scalar characterization of explicitly quasiconvex set-valued maps
La Torre, Davide, (2008)
-
Scalar characterization of explicitly quasiconvex set-valued maps
TORRE, Davide LA, (2008)
-
Exchange rates, prices and their speed of adjustment
Luca, Fanelli, (2006)
- More ...