Solving bilevel programming problems with multicriteria optimization techniques

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 solutins 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 is also discussed in the paper.