This work presents optimality and duality results in multiobjective semi-infinite programming, highlighting conditions of generalized invexity.
In this paper, we formulate generalized (C,α,η,ρ,d)-invexity and based on these definitions, we derive several sufficient conditions for optimality in multiobjective semi-infinite programming problems. Further, under the assumptions of dual model we solve corresponding weak, strong and strict converse duality theorems for these multiobjective semiinfinite programming problem.
No takes yet. Share an insight, caveat, or question.
Pooja Gupta (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: