.png){kind=icon}
.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Bilevel programming
Solution algorithm
Parametric optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W