Solution algorithm for an optimistic linear Stackelberg problem
Solution algorithm for an optimistic linear Stackelberg problem
复制标题
DOI：
10.1016/j.cor.2012.09.002
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
S. Dempe;S. Franke
中科院分区：
文献类型：
--
作者：
S. Dempe;S. Franke
乐观Stackelberg问题是一个双层规划问题，其中下层问题中的约束是参数无关的。对于这类线性问题，提出了计算局部和全局最优解的算法。它们的收敛性被证明。第四部分考虑了下层约束右端摄动的问题，研究了最优解和最优函数值的性质。
The optimistic Stackelberg problem is a bilevel programming problem where the constraints in the lower level problem are parameter independent. For linear problems of that type, algorithms for computing local and global optimal solutions are suggested. Their convergence is shown. In the last part, problems with perturbed right-hand side of the lower level constraints are considered, and the behavior of optimal solutions and of the optimal function value is investigated.