Abstract
The aim of this paper is to study the approximate solution for semi-infinite multiobjective programming problems related to tangential subdifferentials. Under some mild assumptions, we obtain approximate necessary and sufficient optimality conditions of a (weakly) quasi $ \varepsilon $-efficient solution for semi-infinite multiobjective programming problems. We also introduce a mixed type dual model to the semi-infinite multiobjective programming problem, which is different from the one considered in the literature. Finally, we derive some approximate weak, strong and converse duality theorems under the assumptions of generalized convexity. Our results extend and improve the corresponding results in the literature. Some examples are given to illustrate some advantages of our results.
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call