Outer approximation for global optimization of mixed-integer quadratic bilevel problems
type: Item
instance of: scholarly article
title: Outer approximation for global optimization of mixed-integer quadratic bilevel problems
zbMATH Open document ID: 1473.90107
author: Thomas Kleinert
author: Veronika Grimm
author: Martin Schmidt
published in: Mathematical Programming. Series A. Series B
publication date: 2021-08-11T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 7380867
zbMATH Keywords: bilevel optimization
zbMATH Keywords: outer approximation
zbMATH Keywords: quadratic programming
zbMATH Keywords: convex mixed-integer nonlinear optimization
describes a project that uses: Bonmin
describes a project that uses: FilMINT
MaRDI profile type: Publication
full work available at URL: s10107-020-01601-2
OpenAlex ID: W3126901467
cites work: FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
cites work: Multi-parametric global optimization approach for tri-level mixed-integer linear optimization problems
cites work: Multilevel Approaches for the Critical Node Problem
cites work: Convex two-level optimization
cites work: A Branch and Bound Algorithm for the Bilevel Programming Problem
cites work: Mixed-integer nonlinear optimization
cites work: An algorithmic framework for convex mixed integer nonlinear programs
cites work: Q4821526
cites work: Bilevel Knapsack with Interdiction Constraints
cites work: The EU regulation on cross-border trade of electricity: a two-stage equilibrium model
cites work: Foundations of bilevel programming
cites work: Bilevel Programming Problems
cites work: Bilevel road pricing: theoretical analysis and optimality conditions
cites work: Benchmarking optimization software with performance profiles.
cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs
cites work: The impact of neighboring markets on renewable locations, transmission expansion, and generation investment
cites work: A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
cites work: Interdiction Games and Monotonicity, with Application to Knapsack Problems
cites work: On the use of intersection cuts for bilevel optimization
cites work: A dynamic reformulation heuristic for generalized interdiction problems
cites work: Solving mixed integer nonlinear programs by outer approximation
cites work: A Representation and Economic Interpretation of a Two-Level Programming Problem
cites work: Nonconvex equilibrium models for gas market analysis: failure of standard techniques and alternative modeling approaches
cites work: A multilevel model of the European entry-exit gas market
cites work: New Branch-and-Bound Rules for Linear Bilevel Programming
cites work: Neural network for solving convex quadratic bilevel programming problems
cites work: Using EPECs to Model Bilevel Games in Restructured Electricity Markets with Locational Prices
cites work: The polynomial hierarchy and a simple model for competitive analysis
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: Technical Note—There’s No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization
cites work: Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
cites work: Global optimization of multilevel electricity market models including network design and graph partitioning
cites work: A bilevel model of taxation and its application to optimal highway pricing
cites work: A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem
cites work: A neural network for solving a convex quadratic bilevel programming problem
cites work: The Mixed Integer Linear Bilevel Programming Problem
cites work: Q5491447
cites work: A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
cites work: A class of algorithms for mixed-integer bilevel min-max optimization
cites work: Linear programming. Foundations and extensions
cites work: Descent approaches for quadratic bilevel programming
cites work: An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
cites work: A note on linearized reformulations for a class of bilevel linear integer problems
DOI: 10.1007/S10107-020-01601-2
description: scientific article; zbMATH DE number 7380867