On \(G\)-invex multiobjective programming. II: Duality
From MaRDI portal
Publication:1029668
DOI10.1007/s10898-008-9298-6zbMath1192.90186OpenAlexW2025010714MaRDI QIDQ1029668
Publication date: 13 July 2009
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-008-9298-6
(strictly) \(G\)-invex vector function with respect to \(\eta\(G\)-mixed vector dual problem\(G\)-Mond-Weir vector dual problems\(G\)-Wolfe vector dual problemG\)-Karush-Kuhn-Tucker necessary optimality conditions
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items (18)
Optimality and duality for nonsmooth multiobjective programming using G-type I functions ⋮ Generalized minimax programming with nondifferentiable \((G, \beta)\)-invexity ⋮ \(G\)-semipreinvexity and its applications ⋮ New optimality conditions for nonsmooth control problems ⋮ Nondifferentiable mathematical programming involving \((G,{\beta})\)-invexity ⋮ On efficient applications of \(G\)-Karush-Kuhn-Tucker necessary optimality theorems to multiobjective programming problems ⋮ On semi-\((B, G)\)-preinvex functions ⋮ Multiobjective program with support functions under \((G,C,\rho)\)-convexity assumptions ⋮ A new characterization of (weak) Pareto optimality for differentiable vector optimization problems with \(G\)-invex functions ⋮ Sufficiency and duality for multiobjective variational control problems with \(G\)-invexity ⋮ Comments on ``Sufficiency and duality for multiobjective variational control problems with \(G\)-invexity ⋮ Optimality conditions in nondifferentiable \(G\)-invex multiobjective programming ⋮ Unnamed Item ⋮ Multiobjective programming problems with \((G,C,\rho)\)-convexity ⋮ Sufficiency and duality for multiobjective programming under new invexity ⋮ Optimality conditions for interval-valued univex programming ⋮ Sufficient optimality criteria and duality for multiobjective variational control problems with \(G\)-type I objective and constraint functions ⋮ Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New optimality conditions and duality results of \(G\) type in differentiable mathematical programming
- On \(G\)-invex multiobjective programming. I: Optimality
- On duality theory in multiobjective programming
- Optimality conditions in multiobjective differentiable programming
- Multiobjective duality with invexity
- A note on invex functions and duality in multiple objective optimization
- On sufficiency of the Kuhn-Tucker conditions
- On efficiency and duality for multiobjective programs
- Maximal vectors and multi-objective optimization
- Efficiency and generalized convex duality for multiobjective programs
- Optimality criteria and duality in multiple-objective optimization involving generalized invexity
- \((p,r)\)-invexity in multiobjective programming.
- On duality for weakly minimized vector valued optimization problems
- A class of nonconvex functions and mathematical programming
- Generalised convexity and duality in multiple objective programming
- A duality theorem for non-linear programming
- Invex functions and constrained local minima
- Duality in vector optimization
- Duality for Multiple Objective Convex Programs
- On generalised convex mathematical programming
- The Notion of V-r-Invexity in Differentiable Multiobjective Programming
This page was built for publication: On \(G\)-invex multiobjective programming. II: Duality