Optimality and duality for multiobjective programming involving subdifferentiable set functions

Abstract

Necessary conditions for optimality in multiobjective programming involving subdifferentiable set functions are shown to be suficient under the assumption of a particular form of ρ-convexity or ρ-pseudoconvexity. Duality results are thus extended for a Wolfe-type or a Mond-Weir type dual.

Keywords:

• Multiobjective Programming
• ρ-convexit
• ρ-pseudoconvexity
• Duality Theorems
• Subdifferentiable Set Functions

^∗The author is partly supported by NSC. Taiwan

^∗The author is partly supported by NSC. Taiwan

Notes

^∗The author is partly supported by NSC. Taiwan