Parametric global optimisation for bilevel programming

Citations of this article
Mendeley users who have this article in their library.
Get full text


We propose a global optimisation approach for the solution of various classes of bilevel programming problems (BLPP) based on recently developed parametric programming algorithms. We first describe how we can recast and solve the inner (follower's) problem of the bilevel formulation as a multi-parametric programming problem, with parameters being the (unknown) variables of the outer (leader's) problem. By inserting the obtained rational reaction sets in the upper level problem the overall problem is transformed into a set of independent quadratic, linear or mixed integer linear programming problems, which can be solved to global optimality. In particular, we solve bilevel quadratic and bilevel mixed integer linear problems, with or without right-hand-side uncertainty. A number of examples are presented to illustrate the steps and details of the proposed global optimisation strategy. © Springer Science+Business Media LLC 2007.




Faísca, N. P., Dua, V., Rustem, B., Saraiva, P. M., & Pistikopoulos, E. N. (2007). Parametric global optimisation for bilevel programming. In Journal of Global Optimization (Vol. 38, pp. 609–623).

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free