Abstract
Using the theory of abstract optimization problems in infinite-dimensional spaces we provide necessary optimality conditions of first and second order for weakly efficient solutions of the multi-objective infinite programming problem. Sufficient conditions are given under invexity assumptions. We generalize the notion of KKT-invexity for the multi-objective infinite problem and show that this notion is a necessary and sufficient condition for every vector KKT solution to be a weakly efficient solution. Moreover, we develop a theorem of the alternative, useful for proving some of our results.
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 callDisclaimer: 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.
