On \(G\)-invex multiobjective programming. I: Optimality

DOI10.1007/s10898-008-9299-5zbMath1191.90052OpenAlexW1983666584MaRDI QIDQ1029669

Tadeusz Antczak

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-9299-5

zbMATH Keywords

multiobjective programming\(G\)-Karush-Kuhn-Tucker necessary optimality conditions(weak) Pareto optimal solution(strictly) \(G\)-invex vector function with respect to \(\eta\)Kuhn-Tucker constraint qualification

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Related Items (25)

Optimality and duality for nonsmooth multiobjective programming using G-type I functions ⋮ On sufficient optimality conditions for multiobjective control problems ⋮ Generalized minimax programming with nondifferentiable \((G, \beta)\)-invexity ⋮ On vector variational-like inequalities and vector optimization problems with \(\left ({G,\alpha} \right)\)-invexity ⋮ \(G\)-semipreinvexity and its applications ⋮ Semistrict \(G\)-preinvexity and optimality in nonlinear programming ⋮ New optimality conditions for nonsmooth control problems ⋮ Semistrict \(G\)-preinvexity and its application ⋮ Nondifferentiable mathematical programming involving \((G,{\beta})\)-invexity ⋮ Second-order multiobjective programming problems and symmetric duality relations with \(G_{f}\)-bonvexity ⋮ 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 ⋮ Multiobjective fractional symmetric duality in mathematical programming with \((C,G_f)\)-invexity assumptions ⋮ On \(G\)-invex multiobjective programming. II: Duality ⋮ Optimality conditions for interval-valued univex programming ⋮ New class of \(G\)-Wolfe-type symmetric duality model and duality relations under \(G_f\)-bonvexity over arbitrary cones ⋮ Symmetric duality results for second-order nondifferentiable multiobjective programming problem ⋮ Sufficient optimality criteria and duality for multiobjective variational control problems with \(G\)-type I objective and constraint functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The essence of invexity
• New optimality conditions and duality results of \(G\) type in differentiable mathematical programming
• Optimality conditions in multiobjective differentiable programming
• On sufficiency of the Kuhn-Tucker conditions
• Necessary conditions for optimality of nondifferentiable convex multiobjective programming
• Maximal vectors and multi-objective optimization
• Invex functions and generalized convexity in multiobjective programming
• Optimality criteria and duality in multiple-objective optimization involving generalized invexity
• \((p,r)\)-invexity in multiobjective programming.
• Preinvex functions and weak efficient solutions for some vectorial optimization problem in Banach spaces
• Proper efficiency and the theory of vector maximization
• What is invexity?
• Necessary and sufficient conditions in constrained optimization
• Invex functions and constrained local minima
• On generalised convex mathematical programming
• The Notion of V-r-Invexity in Differentiable Multiobjective Programming
• Nonlinear Programming
• \((p,r)\)-invex sets and functions

This page was built for publication: On \(G\)-invex multiobjective programming. I: Optimality