Abstract
We consider a multi-objective semi-infinite programming problem with a feasible set defined by inequality constraints. First, we present a Fritz–John type necessary optimality condition. Then, we introduce two constraint qualifications and derive the weak and strong Karush–Kuhn–Tucker types necessary conditions for (weakly) efficient solution of the considered problem. Finally, an extension of a Caristi–Ferrara–Stefanescu result for the (\(\Phi\), \(\rho\))-invexity is proved, and some sufficient conditions are presented under this weak assumption. All results are given in term of Clarke subdifferential.
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 callMore From: Iranian Journal of Science and Technology, Transactions A: Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
