Sufficiency and duality in multiobjective programming involving generalized \(F\)-convex functions (Q1329322)

The following nonlinear vector maximum problem is considered: \[ \text{Maximize}\quad f(x)= [f_ 1(x), f_ 2(x),\dots, f_ k(x)]\tag{P} \] subject to \(x\in X= \{x; x\in S,\;g(x)\leq 0,\;h(x)= 0\}\), where \(S\) is non-empty open convex subset of \(\mathbb{R}^ n\) and \(f: S\to \mathbb{R}^ k\), \(g: S\to \mathbb{R}^ m\), and \(h: S\to \mathbb{R}^ l\) are differentiable functions at \(x^ 0\in X\), an efficient solution or a candidate for an efficient solution. The aim of the paper is assuming \(F\)-pseudoconvexity and \(F\)-quasiconvexity of the functions, to extend Kuhn-Tucker sufficient optimality conditions, Wolfe duality theorems and Mond-Weir duality theorems to the vector maximum problem (P).