A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs
Year of publication: |
2015
|
---|---|
Authors: | Jeyakumar, Vaithilingam ; Li, Guoyin |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 43.2015, 4, p. 405-410
|
Subject: | Bilevel programming | Global polynomial optimization | Bilevel Farkas' lemma | Semidefinite programming | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
A computational study for bilevel quadratic programs using semidefinite relaxations
Adasme, Pablo, (2016)
-
A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming
Mefo Kue, Floriane, (2023)
-
Chieu, N. H., (2017)
- More ...
-
Exact SDP relaxation for classes of nonlinear semidefinite programming problems
Jeyakumar, Vaithilingam, (2012)
-
Strong duality for robust minimax fractional programming problems
Jeyakumar, Vaithilingam, (2013)
-
Jeyakumar, Vaithilingam, (2014)
- More ...