期刊
JOURNAL OF GLOBAL OPTIMIZATION
卷 68, 期 2, 页码 255-277出版社
SPRINGER
DOI: 10.1007/s10898-016-0478-5
关键词
Bilevel programming; Solution algorithm; Discrete parametric optimization; Global optimization
In this article, we consider two classes of discrete bilevel optimization problems which have the peculiarity that the lower level variables do not affect the upper level constraints. In the first case, the objective functions are linear and the variables are discrete at both levels, and in the second case only the lower level variables are discrete and the objective function of the lower level is linear while the one of the upper level can be nonlinear. Algorithms for computing global optimal solutions using Branch and Cut and approximation of the optimal value function of the lower level are suggested. Their convergence is shown and we illustrate each algorithm via an example.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据