Optimality and duality for nonsmooth multiobjective programming problems with \(V\)-\(r\)-invexity

DOI10.1007/s10898-008-9377-8zbMath1206.49035OpenAlexW1975390508MaRDI QIDQ1037363

Tadeusz Antczak

Publication date: 16 November 2009

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-008-9377-8

zbMATH Keywords

multiobjective programminginvexityconverse dualityKarush-Kuhn-Tucker optimalityMond-Weier dualitywolfe duality

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Existence of optimal solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49J30) Duality theory (optimization) (49N15)

Related Items (13)

Some sufficient efficiency conditions in semiinfinite multiobjective fractional programming based on exponential type invexities ⋮ Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion ⋮ \(G\)-semipreinvexity and its applications ⋮ Nondifferentiable mathematical programming involving \((G,{\beta})\)-invexity ⋮ \(V-E\)-invexity in \(E\)-differentiable multiobjective programming ⋮ On sufficiency and duality for nonsmooth multiobjective programming problems involving generalized \(V-r\)-invex functions ⋮ On nonsmooth V-invexity and vector variational-like inequalities in terms of the Michel-Penot subdifferentials ⋮ On Multi-objective Optimization Problems and Vector Variational-Like Inequalities ⋮ Vector critical points and cone efficiency in nonsmooth vector optimization ⋮ Vector exponential penalty function method for nondifferentiable multiobjective programming problems ⋮ Sufficiency and duality for multiobjective programming under new invexity ⋮ Optimality and duality for nonsmooth multiobjective fractional programming problems involving exponential \(V\)-\(r\)-invexity ⋮ Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Second order duality in multiobjective programming
• \(r\)-preinvexity and \(r\)-invexity in mathematical programming
• Optimality conditions in multiobjective differentiable programming
• Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems
• On sufficiency of the Kuhn-Tucker conditions
• Necessary conditions for optimality of nondifferentiable convex multiobjective programming
• A subgradient duality theorem
• Invex functions and generalized convexity in multiobjective programming
• Optimality criteria and duality in multiple-objective optimization involving generalized invexity
• Nonsmooth analysis of vector-valued mappings with contributions to nondifferentiable programming
• Nonsmooth invexity
• Optimization and nonsmooth analysis
• Nonsmooth multiobjective programming
• A duality theorem for non-linear programming
• On generalised convex mathematical programming
• Generalized Nonsmooth Invexity
• Nonsmooth Invexity in Multiobjective Programming
• Generalized convex composite multi-objective nonsmooth programming and conditional proper efficiency
• On generalised convex multi-objective nonsmooth programming
• The Notion of V-r-Invexity in Differentiable Multiobjective Programming
• Multiobjective programming under \(d\)-invexity

This page was built for publication: Optimality and duality for nonsmooth multiobjective programming problems with \(V\)-\(r\)-invexity