Second-order symmetric duality in vector optimization involving \((K,\eta)\)-pseudobonvexity (Q2120956): Difference between revisions

The paper introduces two new classes of generalization of second-order $(K,\eta)\), \(i=1,2$ for multiobjective nonlinear programming under these generalizations' functions. This paper introduces new classes generalizations of second-order $(K,\eta)$-pseudobonvexity functions and strongly second-order $(K,\eta)$-pseudobonvexity functions $(i=1,2)$ for multiobjective nonlinear programming under these generalizations functions. In addition, the theorems of duality and theorem of self-duality are established under these generalizations function. In the second part, preliminaries are presented such as: a general multiobjective nonlinear programming problem, $\eta_1$-pseudobonvexity in the first variable and $\eta_2$-pseudobonvexity in the second variable for a real twice differentiable function $f:X\times Y$ (where $X, Y$ are open sets in $\mathbb R^n$ and $\mathbb R^m$, respectively), a second-order $(K, \eta_1)$-pseudobonvexity and a strongly second-order $(K, \eta_1)$-pseudobonvexity with each variable. In the third part, Mond-Weir-type symmetric duality is presented for second-order multiobjective nonlinear programming problems and the theorems of weak and strong duality. All theoretical aspects are well exemplified. The pair second-order symmetric duality for multiobjective nonlinear programs is formulated by considering the optimization with respect to an arbitrary cone under the generalizations of the second-order $(K, \eta)$-pseudobonvexity function and strongly second-order $(K, \eta)$-pseudobonvexity function. The author appreciates that the results are the generalization of the relaxing definition of $\eta$-pseudobonvex functions.