In this paper we study the relationship between bilevel optimization and bicriteria optimization. Given a bilevel optimization problem, we introduce an order relation such that the optimal solutions of the bilevel problem are the nondominated points with respect to the order relation. In the case where the lower level problem of the bilevel optimization problem is convex and continuously differentiable in the lower level variables, this order relation is equivalent to a second, more tractable order relation. Then, we show how to construct a (nonconvex) cone for which we can prove that the nondominated points with respect to the order relation induced by the cone are also nondominated points with respect to any of the two order relations mentioned before. We also comment on the practical and computational implications of our approach.
Citation
Preprint 03-08, Department of Mathematics, University of Coimbra, Portugal, April 2003