On Efficiency in Nondifferentiable Multiobjective Optimization Involving Pseudo d-Univex Functions; Duality

DOI10.1007/978-1-4419-9640-4_16zbMath1247.90240OpenAlexW63520626MaRDI QIDQ2912160

No author found.

Publication date: 14 September 2012

Published in: Springer Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4419-9640-4_16

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Derivative-free methods and methods using generalized derivatives (90C56) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The essence of invexity
• Invexity and optimization
• Multiobjective duality with invexity
• On sufficiency of the Kuhn-Tucker conditions
• Necessary conditions for optimality of nondifferentiable convex multiobjective programming
• Sufficiency and duality in nondifferentiable multiobjective programming
• Nondifferentiable multiobjective programming under generalized \(d\)-univexity
• Pseudoinvexity, optimality conditions and efficiency in multiobjective problems; duality
• What is invexity?
• Invex functions and constrained local minima
• Generalized convexity in multiobjective programming
• Multiobjective programming under \(d\)-invexity

This page was built for publication: On Efficiency in Nondifferentiable Multiobjective Optimization Involving Pseudo d-Univex Functions; Duality