Mixed-integer bilevel representability

DOI10.1007/s10107-019-01424-wzbMath1480.90176arXiv1808.03865OpenAlexW2970684385WikidataQ127280227 ScholiaQ127280227MaRDI QIDQ2220657

Sriram Sankaranarayanan, Amitabh Basu, Christopher Thomas Ryan

Publication date: 25 January 2021

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.03865

zbMATH Keywords

representabilitybilevel programmingStackelberg games

Mathematics Subject Classification ID

Mixed integer programming (90C11) 2-person games (91A05) Mathematical programming (90C99)

Related Items

A survey on mixed-integer programming techniques in bilevel optimization ⋮ A Gilmore-Gomory construction of integer programming value functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some properties of convex hulls of integer points contained in general convex sets
• Bilevel programming and the separation problem
• Enhanced exact algorithms for discrete bilevel linear problems
• A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
• Parametric integer programming algorithm for bilevel mixed integer programs
• The value function of a mixed integer program: I
• The value function of a mixed integer program. II
• Links between linear bilevel and mixed 0-1 programming problems
• Solving discrete linear bilevel optimization problems using the optimal value reformulation
• On the use of intersection cuts for bilevel optimization
• A closed-form representation of mixed-integer program value functions
• Discrete linear bilevel programming problem
• Mixed-integer linear representability, disjunctions, and variable elimination
• Mixed-integer convex representability
• Disjunctive cuts for continuous linear bilevel programming
• Mixed Integer Linear Programming Formulation Techniques
• New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
• Extended Formulations in Mixed-Integer Convex Programming
• Integer Programming
• A Study on the Computational Complexity of the Bilevel Knapsack Problem
• Modelling with integer variables
• The Linear Complementarity Problem
• The polynomial hierarchy and a simple model for competitive analysis
• The value function of an integer program
• Some Basis Theorems for Integral Monoids
• The Theory of Moral Hazard and Unobservable Behaviour: Part I
• A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
• A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem
• The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
• Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function
• The Mixed Integer Linear Bilevel Programming Problem