Abstract
In this paper, we extend the concept of cone-convexlikeness of single-valued maps to set-valued maps and study super efficiency in cone-convexlike vector optimization with set-valued maps. Under the assumption of the cone-convexlikeness, some characterizations of super efficiency are established in terms of the scalarization, Lagrange multipliers and super duality, respectively.
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.
