Abstract
In this paper, we study the approximate solutions for vector optimization problem with set-valued functions. The scalar characterization is derived without imposing any convexity assumption on the objective functions. The relationships between approximate solutions and weak efficient solutions are discussed. In particular, we prove the connectedness of the set of approximate solutions under the condition that the objective functions are quasiconvex set-valued functions.
Sign-in/Register to access full text options 
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.
