Abstract
The paper deals with semivectorial bilevel optimization problems. The upper level is a scalar optimization problem to be solved by the leader, and the lower level is a multiobjective optimization problem to be solved by several followers acting in a cooperative way inside the greatest coalition, so choosing among Pareto solutions. In the so-called “optimistic problem”, the followers choose among their best responses (i.e. Pareto solutions) one which is the most favorable for the leader. The opposite is the “pessimistic problem”, when there is no cooperation between the leader and the followers, and the followers choice among their best responses may be the worst for the leader. The paper presents a general method which allows, under certain mild hypotheses, to transform a semivectorial bilevel problem into an ordinary bilevel optimization. Some applications are given.
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 callMore From: Annals of the Academy of Romanian Scientists Series on Mathematics and Its Application
Disclaimer: 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.
