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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	European journal of operational research Ročník 254; číslo 1; s. 9 - 18
Hlavní autoři:	Adasme, Pablo, Lisser, Abdel
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 01.10.2016 Elsevier Sequoia S.A Elsevier
Témata:	(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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!