Abstract
In this paper, we propose a penalty method to solve a multi-objective bilevel problem where the upper level is a non linear multi-objective optimization problem and the lower level is a linear multi-objective optimization problem. This penalty method transform the resolution of this problem to the resolution of a sequence of one level multi-objective optimization problems with linear constraints. When all the functions are linear, the penalized problem become a bilinear multiobjective optimization problem.
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.
