Optimality and Duality for Multiobjective Semiinfinite Programming Problems Involving Generalized (C,α,η,ρ,d)-Invexity

Key Points

• Optimality conditions are derived, emphasizing the role of generalized (C,α,η,ρ,d)-invexity in these problems.
• The findings reveal sufficient conditions for solving multiobjective programming challenges effectively.
• Weak, strong, and strict converse duality theorems for these problems illustrate their interrelations under dual models.
• The implications of this framework can enhance methods in optimization theories and applications in various fields.