.png){kind=icon}
.png){kind=icon}
返回
Solution algorithm for an optimistic linear Stackelberg problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2012.09.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Bilevel programming
Solution algorithm
Parametric optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。