Parametric global optimisation for bilevel programming

  • Faísca N
  • Dua V
  • Rustem B
 et al. 
  • 38


    Mendeley users who have this article in their library.
  • 63


    Citations of this article.


We propose a global optimisation approach for the solution of various classes of bilevel programming problems (BLPP) based on recently developed para- metric programming algorithms. We first describe how we can recast and solve the inner (follower’s) problem of the bilevel formulation as a multi-parametric program- ming problem, with parameters being the (unknown) variables of the outer (leader’s) problem. By inserting the obtained rational reaction sets in the upper level prob- lem 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.

Author-supplied keywords

  • Bilevel programming
  • Mixed-integer
  • Parametric programming
  • Quadratic
  • Uncertainty

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free