Bilevel Optimization

Bilevel Optimization is a mathematical optimization framework consisting of two nested optimization problems, where the feasible region of the upper-level (leader’s) problem is constrained by the solution set of the lower-level (follower’s) problem.

1.3K

Publications

67.5K

Citations

2.7K

Authors

916

Institutions

Publications per year

2017–2026

576

Variants

Bilevel Programming

Authors

2.7K

  1. GS
    Gilles Savard

    Polytechnique Montréal, Canada

    26 publications · 4.8K citations

    23

    h-index

  2. SD
    Stephan Dempe

    TU Bergakademie Freiberg, Germany

    34 publications · 2K citations

    23

    h-index

  3. AS
    Ankur Sinha

    Aalto University, Finland

    23 publications · 1.2K citations

    18

    h-index

  4. KD
    Kalyanmoy Deb

    Michigan State University, United States

    22 publications · 1.2K citations

    18

    h-index

  5. JJ
    Jane J. Ye

    University of Victoria, Canada

    19 publications · 1.3K citations

    18

    h-index

1–5 of 2.7K

Venues

  1. IEEE Transactions on Power Systems

    66 publications · 6.6K citations

    45

    h-index

  2. Journal of Optimization Theory and Applications

    33 publications · 2.1K citations

    26

    h-index

  3. Journal of Global Optimization

    38 publications · 1.9K citations

    25

    h-index

  4. European Journal of Operational Research

    31 publications · 1.5K citations

    23

    h-index

  5. IEEE Transactions on Smart Grid

    27 publications · 1.6K citations

    23

    h-index

1–5