[1]Ishizuka Y, Aiyoshi E. Double penalty method for bilevel optimization problems. Annals of Oper Res,1992, 34: 73-88

[2]Liu G, Han J, Wang S. The trust region algorithm for bilevel optimization problem. Science Bulletin (China), 1998,43(4): 383-387

[3]Anandalingan, White D J. A solution method for the liner static Stackelberg problem using penalty functions. IEEE Transactions on Automatic Control, 1990, 35(10): 1170-1173

[4]Wan Z, et al. Approximate decomposition method for solving the bilevel programming with the minimum risk. J of Engineering Mathematics, 2000,19(2): 25-30

[5]Lordan P, Morgan J. A theoretical approximation scheme for Stackelberg problem. J O T A, 1989, 61(1):95-109

[6]Lordan P, Morgan J. New results on approximate solutions for Two-level optimization. Optimization,1989, 20(6): 819-836

[7]Lignola M B, Morgan J. Stability of regularized bilevel programming problems. J O T A, 1997, 93(3):575-596

[8]Shi B, et al. Approaching method for multiobjective decision making (II). Journal of System Engineering,1996,11(3): 1-10

[9]Wang J. Approximate nonlinear programming algorithms for solving stochastic programming with recourse.Annals of Oper Res, 1991, 31: 371-384