A new coordination model for ill-posed bilevel programming problem

This paper studied the leader how to motivate the follower to maximize its interests for ill-posed linear bilevel programming problem. We first presented a coordination model and gived its corresponding penalty problem. Under some conditions, we established the result on the existence of the solution. Then, an algorithm was developed to obtain a coordination solution to the original bilevel programming problem. Finally, numerical results show that the proposed method is feasible.