| In this paper, for a bilevel problem (S), we first give an approach by a sequence of reverse convex programs. Then, using some results on reverse convex programs, we give a second approach which reduces the problem (S) to a min-max problem with linked constraints. Finally, by considering the case where the follower's objective and constraint functions are respectively polyhedral and linear, the second approach is improved. In fact, in this last case, the problem (S) is reduced to a maximization problem of a polyhedral convex function over a compact convex set. |
|
