New partial cooperation model for ill-posed bllevel programming problems.

Partial cooperation models have been studied for many years to solve the ill-posed bileved programming problems where the follower's optimal reaction is not unique. However, in these existed models, the followers cooperation level does not depend on the leaders decision. This paper proposes a new model to solve this deficiency. The numerical results show the new model has optimal solutions when the reaction set of the lower level is discrete, lower sem-continuous or non-lower semi-continuous. [ABSTRACT FROM AUTHOR]