Abstract
In this paper, we consider a vector optimization problem involving locally Lipschitz approximately convex functions and give several concepts of approximate efficient solutions. We formulate approximate vector variational inequalities of Stampacchia and Minty type and use these inequalities as a tool to characterize an approximate efficient solution of the vector optimization problem.
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.
