Abstract
We introduce in this paper a new relation between bilevel programming and multicriteria optimization. We show that solving a certain class of bilevel programming problem can be equivalent to solve two independents multicriteria optimization problems. The optimal solutions of the bilevel problem are then the Pareto optimal points corresponding to the nondominated points belonging to the intersection of the two efficient sets. Comment on the practical implementation of the obtained relation is discussed. A generalisation of the relation between bilevel programming optimization and multicriteria optimization, first presented by Fulop [1] is also discussed in the paper.
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.
