Abstract
We study a multiobjective optimality problem constrained by parameterized variational inequalities. By separation theorem for convex sets, we translate the multiobjective optimality problem into single objective optimality problem, and obtain the first-order optimality conditions of this problem. Under the calmness conditions, an efficient upper estimate of coderivative for a composite set-valued mapping is derived. At last, we apply that result to the multiobjective bilevel programming problem and MPEC with Nash equilibrium constraints.
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.
