On a Tractable Single-Level Reformulation of a Multilevel Model of the European Entry-Exit Gas Market with Market Power

We propose a framework that allows to quantitatively analyze the interplay of the different agents involved in gas trade and transport in the context of the European entry-exit system. Previous contributions have focused on the case of perfectly competitive buyers and sellers of gas, which allows to replace the respective market equilibrium problem by a … Read more

Connections between Robust and Bilevel Optimization

Robust and bilevel optimization share the common feature that they involve a certain multilevel structure. Hence, although they model something rather different when used in practice, they seem to have a similar mathematical structure. In this paper, we analyze the connections between different types of robust problems (static robust problems with and without decision-dependence of … Read more

A Robust Approach for Modeling Limited Observability in Bilevel Optimization

In bilevel optimization, hierarchical optimization problems are considered in which two players – the leader and the follower – act and react in a non-cooperative and sequential manner. In many real-world applications, the leader may face a follower whose reaction deviates from the one expected by the leader due to some kind of bounded rationality. … Read more

On Linear Bilevel Optimization Problems with Complementarity-Constrained Lower Levels

We consider a novel class of linear bilevel optimization models with a lower level that is a linear program with complementarity constraints (LPCC). We present different single-level reformulations depending on whether the linear complementarity problem (LCP) as part of the lower-level constraint set depends on the upper-level decisions or not as well as on whether … Read more

A fresh CP look at mixed-binary QPs: New formulations and relaxations

Triggered by Burer’s seminal characterization from 2009, many copositive (CP) reformulations of mixed-binary QPs have been discussed by now. Most of them can be used as proper relaxations, if the intractable co(mpletely )positive cones are replaced by tractable approximations. While the widely used approximation hierarchies have the disadvantage to use positive-semidefinite (psd) matrices of orders … Read more