BilevelJuMP.jl: Modeling and Solving Bilevel Optimization in Julia

Author name not available (Why is that?)

Publication date: 4 May 2022

Abstract: In this paper we present BilevelJuMP, a new Julia package to support bilevel optimization within the JuMP framework. The package is a Julia library that enables the user to describe both upper and lower-level optimization problems using the JuMP algebraic syntax. Due to the generality and flexibility our library inherits from JuMP's syntax, our package allows users to model bilevel optimization problems with conic constraints in the lower level and all JuMP supported constraints in the upper level (Conic, Quadratic, Non-Linear, Integer, etc.). Moreover, the user-defined problem can be subsequently solved by various techniques relying on mathematical program with equilibrium constraints (MPEC) reformulations. Manipulations on the original problem data are possible due to MathOptInterface.jl's structures and Dualization.jl features. Hence, the proposed package allows quickly model, deploy, and thereby experiment bilevel models based on off-the-shelf mixed integer linear programming and nonlinear solvers.

Has companion code repository: https://github.com/joaquimg/bileveljump.jl

This page was built for publication: BilevelJuMP.jl: Modeling and Solving Bilevel Optimization in Julia

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6398283)