Second-order symmetric duality for multiple objectives nonlinear programming under generalizations of cone-preinvexity functions (Q6159291)

The set \(X\) is called an invex at its point \(u\) with respect to the mapping \(\eta: X\times X\rightarrow \mathbb{R}^n\) if \(\forall x\in X\), \(\forall\lambda\in(0,1)\), we have \(u + \lambda\eta(x, u)\in X\). If \(X\) is invex for all its vertices, we say that it is invex w. r. t. the mapping \(\eta\). The article presents generalizations of the cone-preinvexity functions and studies a pair of second-order symmetric multiple-objective nonlinear programming (MONLP) problems under generalizations of the cone-preinvexity functions (see also [\textit{S. Khurana}, Eur. J. Oper. Res. 165, No. 3, 592--597 (2005; Zbl 1062.90059)]). In the article, the general MONLP problem is formulated as follows: \[K-\min f_i(x),\; i=1, 2, \dots, p\] \[\text{subject to }x\in X=\{x\in C:-g_j(x)\in Q,\, j=1, 2, \dots, m\}\] where \(C\subset \mathbb{R}^n\), \(K\) and \(Q\) are closed invex cones and \(f_i : \mathbb{R}^n\rightarrow R^p\), \(g_j : \mathbb{R}^n\rightarrow \mathbb{R}^m\). In addition, the author establishes and proves duality theorems and a self-duality theorem for these (MONLP) problems under these generalizations of the cone-preinvexity functions. Finally, four nontrivial numerical examples are given to show that the results of the weak and strong duality theorems hold.