This paper is focused on approximate ( $$\varepsilon$$ -efficient) solutions of multiobjective mathematical programs. We introduce a new $$\varepsilon$$ -efficiency concept which extends and unifies different notions of approximate solution defined in the literature. We characterize these...

In multicriteria optimization, several objective functions have to be minimized simultaneously. For this kind of problem, approximations to the whole solution set are of particular importance to decision makers. Usually, approximating this set involves solving a family of parameterized...

In multicriteria optimization, several objective functions have to be minimized simultaneously. For this kind of problem, approximations to the whole solution set are of particular importance to decision makers. Usually, approximating this set involves solving a family of parameterized...

The aim of this paper is to characterize in terms of classical convexity and quasiconvexity of extended real-valued functions those set-valued maps which are K-convex or K-quasiconvex with respect to a convex cone K. In particular, we recover some known characterizations of K-convex and...

In this paper we investigate the existence of Pareto equilibria in vector-valued extensive form games. In particular we show that every vector-valued extensive form game with perfect information has at least one subgame perfect Pareto equilibrium in pure strategies. If one tries to prove this...

The aim of this paper is to characterize in terms of classical convexity and quasiconvexity of extended real-valued functions those set-valued maps which are K-convex or K-quasiconvex with respect to a convex cone K. In particular, we recover some known characterizations of K-convex and...