A saddle-point characterization of Pareto optima (Q1340067)

This paper offers a necessary and sufficient condition which characterizes the Pareto minimum points through the agency of saddle points for the following multiobjective optimization problems \[ \text{Min}\{\Phi^ k(x): k= 1,\dots q\},\quad\text{s.t.}\quad f^ i(x)\leq 0,\quad i= 1,\dots, m,\tag{MP} \] where the objective \(\Phi^ k: \mathbb{R}^ n\to \mathbb{R}\) \((k= 1,\dots, q)\) and the constraints \(f^ i: \mathbb{R}^ n\to \mathbb{R}\), \(i= 1,\dots, m\). The authors give also a characterization of Pareto minimum points for the above type of finite- dimensional vectorial optimization programs using the subgradients. Generalizations of the indicated theorems for vectorial optimizations problems with multifunctions may be found in the book of \textit{G. Isac} and the reviewer [`The best of approximation and optimization in locally convex spaces' (1993; Zbl 0776.41023)].