Second-order symmetric duality for multiple objectives nonlinear programming under generalizations of cone-preinvexity functions
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.
- Second order symmetric duality in multiobjective programming involving generalized cone-invex functions
- Second-order symmetric duality for multiobjective programming problem with cone constraints
- Generalized preinvexity and second order duality in multiobjective programming
- SUFFICIENT OPTIMALITY CONDITIONS AND DUALITY IN MULTIOBJECTIVE OPTIMIZATION INVOLVING GENERALIZED CONVEXITY
- Symmetric duality in multiobjective programming involving generalized cone-invex functions
- Nondifferentiable multiobjective symmetric dual programs over cones
- Second order symmetric duality for nondifferentiable multiobjective programming involving cones
- Mond-Weir type second-order symmetric duality in multiobjective programming over cones
- The research of Mond-Weir duality for programming with B-(p,r)-pre-invexity function
- Second-order multiobjective symmetric duality involving cone-bonvex functions
- Converse duality in nonlinear programming with cone constraints
- Generalization of preinvex and B-vex functions
- Higher-order symmetric duality in vector optimization problem involving generalized cone-invex functions
- scientific article; zbMATH DE number 446505 (Why is no real title available?)
- scientific article; zbMATH DE number 4187467 (Why is no real title available?)
- Multiobjective nonlinear second order symmetric duality with \((K,F)\)-pseudoconvexity
- Multiobjective second order symmetric duality with cone constraints
- Multiobjective symmetric duality with cone constraints
- Nondifferentiable multiobjective higher-order duality relations for unified type dual models under type-I functions
- Second order symmetric duality in mathematical programming with \(F\)-convexity
- Second-order symmetric and self duality in multiobjective programming
- Second-order symmetric duality in vector optimization involving (K,)-pseudobonvexity
- Symmetric and self duality in vector optimization problem
- Symmetric duality for nonlinear programming problem involving -bonvex functions
- Symmetric duality in multiobjective programming involving generalized cone-invex functions
- Symmetric duality results for second-order nondifferentiable multiobjective programming problem
This page was built for publication: Second-order symmetric duality for multiple objectives nonlinear programming under generalizations of cone-preinvexity functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6159291)
