Abstract
In this work, we formulate the vector variational inequalities of Stampacchia and Minty types in terms of directional convexificators, and relate them to a vector optimization problem. Our approach consists of using a suitable directional generalized convexity, given in terms of directional convexificators, to help us figure out the necessary and sufficient conditions for a point to be an efficient solution to the vector optimization problem. We also investigate the weak versions of the vector variational inequalities and provide several results for determining weak efficient solutions. An example illustrating both our findings and the limits of some earlier research is provided.
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.
