Solution algorithm for an optimistic linear Stackelberg problem

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.