Semistrictly quasiconvex mappings and non-convex vector optimization (Q1880266): Difference between revisions

We are given an ordering cone \(P\) in the \(m\)-dimensional space. The author introduces in his paper semistrictly (\(\mathbb R^m \backslash \operatorname{int}P\))-quasiconvex functions which contain the \(P\)-quasiconvex functions (and therefore also non-convex vector functions). This new class of functions allows to unify results on the existence of weakly efficient solutions as well as the compactness of the set of weakly efficient solutions. The latter one is done by imposing a coercivity condition. Moreover various characterization results for the non-emptiness, convexity and compactness of the solution set for a subclass on the real-line is shown. Also the notion of explicit (\(\mathbb R^m \backslash\operatorname{int }P\))-quasiconvexity is introduced analogous to explicit quasiconvexity for real-valued functions. The paper ends with some brief concluding remarks.