A computational study for bilevel quadratic programs using semidefinite relaxations

•We consider bilevel quadratic problems with binary variables in the leader and convex quadratic follower problems.•We derive equivalent Mixed Integer Linear Programming formulations. Thus, we compute optimal solutions and upper bounds.•We transform the bilevel problems into binary quadratic program...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	European journal of operational research Jg. 254; H. 1; S. 9 - 18
Hauptverfasser:	Adasme, Pablo, Lisser, Abdel
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 01.10.2016 Elsevier Sequoia S.A Elsevier
Schlagworte:	(I) Conic programming and interior point methods Bilevel programming Computational efficiency Computer Science Convex analysis Decision analysis Equivalence Followers Integer programming Linear programming Mathematical models Mathematical problems Mixed integer Mixed integer linear programming Operations Research Optimization Quadratic programming Semidefinite programming Studies Bilevel programming Semidefinite programming (I) Conic programming and interior point methods Mixed integer linear programming
ISSN:	0377-2217, 1872-6860
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!