A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming

DOI10.1016/j.orl.2022.12.005zbMath1525.90401OpenAlexW4313421884MaRDI QIDQ6161288

Floriane Mefo Kue, Stephan Dempe

Publication date: 27 June 2023

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2022.12.005

zbMATH Keywords

semidefinite programmingsemi-infinite programmingbilevel programmingsolution algorithm

Mathematics Subject Classification ID

Semidefinite programming (90C22) Mixed integer programming (90C11) Nonlinear programming (90C30) Hierarchical games (including Stackelberg games) (91A65) Semi-infinite programming (90C34)

Cites Work

• Unnamed Item
• Solution algorithm for an optimistic linear Stackelberg problem
• On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
• Infinitely constrained optimization problems
• An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs
• Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems
• Semi-Infinite Programming: Theory, Methods, and Applications
• On the numerical solution of a class of Stackelberg problems
• A Global Algorithm for Nonlinear Semidefinite Programming
• Optimality conditions for bilevel programming problems
• Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
• Bilevel Programming Problems
• Bilevel Polynomial Programs and Semidefinite Relaxation Methods

This page was built for publication: A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming