Login / Signup
A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs.
Vaithilingam Jeyakumar
Guoyin Li
Published in:
Oper. Res. Lett. (2015)
Keyphrases
</>
bi objective
linear programming
lower level
bilevel programming
efficient solutions
polynomial size
polynomial equations
optimal solution
feasible solution
implicit enumeration
search algorithm
vapnik chervonenkis dimension
global minima