Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 41, Issue -, Pages 277-281Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2012.09.002
Keywords
Bilevel programming; Solution algorithm; Parametric optimization
Ask authors/readers for more resources
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.
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