Optimization Online


Bilevel optimization: theory, algorithms and applications

Stephan Dempe(dempe***at***tu-freiberg.de)

Abstract: Bilevel optimization problems are hierarchical optimization problems where the feasible region of the so-called upper level problem is restricted by the graph of the solution set mapping of the lower level problem. Aim of this article is to collect a large number of references on this topic, to show the diversity of contributions and to support young colleagues who try to start research in this challenging and interesting field.

Keywords: Bilevel Optimization; Mathematical Programs with Complementarity Constraints; Optimality conditions; Applications; Necessary optimality conditions; Solution algorithms; Metaheuristics; Optimistic and pessimistic bilevel optimization problems.

Category 1: Convex and Nonsmooth Optimization (Nonsmooth Optimization )

Category 2: Nonlinear Optimization (Constrained Nonlinear Optimization )

Citation: Preprint 2018-11, Fakultät für Mathematik und Informatik, TU Bergakademie Freiberg

Download: [PDF]

Entry Submitted: 08/17/2018
Entry Accepted: 08/17/2018
Entry Last Modified: 08/17/2018

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society