Efficiency and generalized convex duality for nondifferentiable multiobjective programs

DOI10.1155/2010/930457zbMath1184.90148OpenAlexW2033831722WikidataQ59249944 ScholiaQ59249944MaRDI QIDQ962544

Kwan Deok Bae, Do Sang Kim, Young-Min Kang

Publication date: 7 April 2010

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/231452

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (6)

Optimality and duality theorems in nonsmooth multiobjective optimization ⋮ Multiobjective program with support functions under \((G,C,\rho)\)-convexity assumptions ⋮ On the Fritz John saddle point problem for differentiable multiobjective optimization ⋮ Sufficiency and duality for multiobjective programming under new invexity ⋮ Sufficient optimality conditions and duality for nonsmooth multiobjective optimization problems via higher order strong convexity ⋮ Sufficiency and duality in nondifferentiable multiobjective programming involving higher order strong invexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong convexity of sets and functions
• Efficiency and generalized convex duality for multiobjective programs
• Nonsmooth multiobjective programs with \(V\)-\(\rho\)-invexity
• Duality for some nondifferentiable static multiobjective programming problems
• Duality for a class of nondifferentiable multiobjective programming problems
• Optimality conditions and duality for a class of nondifferentiable multiobjective programming problems
• Proper efficiency and the theory of vector maximization
• Strong and Weak Convexity of Sets and Functions
• Proper Efficiency and Multiobjective Duality in Nonlinear Programming
• A duality theorem for non-linear programming
• Non differentiable symmetric duality

This page was built for publication: Efficiency and generalized convex duality for nondifferentiable multiobjective programs