Journal
JOURNAL OF GLOBAL OPTIMIZATION
Volume 44, Issue 3, Pages 313-337Publisher
SPRINGER
DOI: 10.1007/s10898-008-9325-7
Keywords
Bilevel programming; Nonconvex programming; DC programming; DCA; Global optimization; Branch and bound techniques
Ask authors/readers for more resources
We propose a method for finding a global solution of a class of nonlinear bilevel programs, in which the objective function in the first level is a DC function, and the second level consists of finding a Karush-Kuhn-Tucker point of a quadratic programming problem. This method is a combination of the local algorithm DCA in DC programming with a branch and bound scheme well known in discrete and global optimization. Computational results on a class of quadratic bilevel programs are reported.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available