A multicriteria optimization problem is called Pareto reducible if its weakly efficient solutions actually are efficient solutions for the problem itself or for at least one subproblem obtained from it by selecting certain criteria. The aim of this paper is to investigate a similar property within a special class of generalized vector variational inequalities, under appropriate generalized convexity assumptions.
Decomposition of generalized vector variational inequalities
ROCCA, MATTEO
2012-01-01
Abstract
A multicriteria optimization problem is called Pareto reducible if its weakly efficient solutions actually are efficient solutions for the problem itself or for at least one subproblem obtained from it by selecting certain criteria. The aim of this paper is to investigate a similar property within a special class of generalized vector variational inequalities, under appropriate generalized convexity assumptions.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
