On Convex Lower-Level Black-Box Constraints in Bilevel Optimization with an Application to Gas Market Models with Chance Constraints

Holger Heitsch (heitschwias-berlin.de)
René Henrion (henrionwias-berlin.de)
Thomas Kleinert (thomas.kleinertfau.de)
Martin Schmidt (martin.schmidtuni-trier.de)

Abstract: Bilevel optimization is an increasingly important tool to model hierarchical decision making. However, the ability of modeling such settings makes bilevel problems hard to solve in theory and practice. In this paper, we add on the general difficulty of this class of problems by further incorporating convex black-box constraints in the lower level. For this setup, we develop a cutting-plane algorithm that computes approximate bilevel-feasible points. We apply this method to a bilevel model of the European gas market in which we use a joint chance constraint to model uncertain loads. Since the chance constraint is not available in closed form, this fits into the black-box setting studied before. For the applied model, we use further problem-specific insights to derive bounds on the objective value of the bilevel problem. By doing so, we are able to show that we solve the application problem to approximate global optimality. In our numerical case study we are thus able to evaluate the welfare sensitivity in dependence of the achieved safety level of uncertain load coverage.

Keywords: Bilevel optimization, Black-box constraints, Chance constraints, Cutting planes, European gas market

Category 1: Stochastic Programming

Category 2: Applications -- OR and Management Sciences

Category 3: Integer Programming (Cutting Plane Approaches )

Citation:

Download: [PDF]

Entry Submitted: 04/07/2021
Entry Accepted: 04/07/2021
Entry Last Modified: 04/04/2022

Modify/Update this entry