Sufficient conditions for global weak Pareto solutions in multiobjective optimization

In this paper we derive new sufficient conditions for global weak Pareto solutions to set-valued optimization problems with general geometric constraints of the type \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \text{ maximize}\quad F(x) \quad \text{ subject} \text{ to}\quad x\in \Omega , \end{aligned}$$\end{document}where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$F: X\rightrightarrows Z$$\end{document} is a set-valued mapping between Banach spaces with a partial order on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$Z$$\end{document}. Our main results are established by using advanced tools of variational analysis and generalized differentiation; in particular, the extremal principle and full generalized differential calculus for the subdifferential/coderivative constructions involved. Various consequences and refined versions are also considered for special classes of problems in vector optimization including those with Lipschitzian data, with convex data, with finitely many objectives, and with no constraints.