Journal
JOURNAL OF GLOBAL OPTIMIZATION
Volume 60, Issue 3, Pages 459-481Publisher
SPRINGER
DOI: 10.1007/s10898-013-0120-8
Keywords
Bilevel programming; Nonconvex inner problem; Branch and bound
Funding
- Leverhulme Trust
- EPSRC [EP/J003840/1]
- Engineering and Physical Sciences Research Council [EP/J003840/1] Funding Source: researchfish
- EPSRC [EP/J003840/1] Funding Source: UKRI
Ask authors/readers for more resources
In the first part of this work, we presented a global optimization algorithm, Branch-and-Sandwich, for optimistic bilevel programming problems that satisfy a regularity condition in the inner problem (Kleniati and Adjiman in J Glob Optim, 2014). The proposed approach can be interpreted as the exploration of two solution spaces (corresponding to the inner and the outer problems) using a single branch-and-bound tree, where two pairs of lower and upper bounds are computed: one for the outer optimal objective value and the other for the inner value function. In the present paper, the theoretical properties of the proposed algorithm are investigated and finite e-convergence to a global solution of the bilevel problem is proved. Thirty-four problems from the literature are tackled successfully.
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