3Z. K. Xu. Deriving the Properties of Linear Bilevel Programming via a Penalty Function Approach[J] 1999,Journal of Optimization Theory and Applications(2):441～456
4A. Yezza. First-order necessary optimality conditions for general bilevel programming problems[J] 1996,Journal of Optimization Theory and Applications(1):189～219
5D. J. White,G. Anandalingam. A penalty function approach for solving bi-level linear programs[J] 1993,Journal of Global Optimization(4):397～419
2White D J, Anandalingam G. A penalty function approach for solving bilevel linear programs[J]. J of Global Optimization, 1993,3(2) :397--419.
3Xu Z K. Deriving the properties of linear bilevel programming via a penalty function approach[J]. J of Optimization Theory and Application, 1999,103(2) :441--456.
4Yezza A. First-order necessary optimality conditions for general bilevel programming problems[J]. J of Optimization Theory and Application, 1996,89 : 189 --219.
5Mathur K, Puri M C. On bilevel functional programming[J]. Optimization, 1995,35:215- 226.
6Rockafellar R T. Convex Analysis[M]. New Jewsey: Princeton University Press,Princeton, 1972.
7Jeroslow R. G. The polynomial hierarchy and a simple model for competitive analysis. Mathematical Programming, 1985, 32: 146～164.
8Ben-Ayed O., Blair C. E. Computational difficulties of bilevel linear programming. Operations Research, 1990, 38: 556～560.
9Bard J. F. Some properties of the bilevel programming problem. Journal of Optimization Theory and Applications, 1991, 68: 371～378.
10Bialas W. F., Karwan M. H. On two-level optimization. IEEE Trans. AC, 1982, 27: 211～214.
