1 |
G.Savard, J.Gauvin. The steepest descent direction for the nonlinear bilevel programming problem, Operations Research Letters 15(1994), 275-282.
|
2 |
G.M.Wang, X.J.Wang, et al. A globally convergent algorithm for a class of bilevel nonlinear programming problem, Applied Mathematics and Computation 188(2007), 166-172.
DOI
ScienceOn
|
3 |
W.Zhong, N.Xu. Boltzmann machine method of two level decision making, Journal of Systems Engineering 10(1)(1995), 7-13.
|
4 |
J.Bard. Some properties of the bilevel linear programming, Journal of optimization Theory and Applications 32(1991), 146-164.
|
5 |
J.Bard. Practical Bilevel Optimization: Algorithm and Applications, Kluwer Academic Publishers, Dordrecht, 1998.
|
6 |
O.Ben-Ayed, O.Blair. Computational difficulity of bilevel linear programming, Operations Research 38(1990), 556-560.
DOI
ScienceOn
|
7 |
B.Closon, P.Marcotte and G.Savard. A trust region method for nonlinear bilevel programming: alogorithm and computational experience, Computational Optimization and Applications 30(3)(2005), 211-217.
DOI
ScienceOn
|
8 |
S.Dempe. Foundation of bilevel programming, Kluwer Academic Publishers, London, 2002.
|
9 |
P.Hansen, B.Jaumard, G.Savard. New branch-and-bound rules for linear bilevel program- ming, SIAM Journal on Science and Statistical Computing 13(1992), 1194-1217.
DOI
|
10 |
Y.Ishizuka, E.Aiyoshi. Double penalty method for bilevel optimization problems, Annals of Operations Research 34(1992), 73-88.
DOI
ScienceOn
|
11 |
Y.Lv, T.Hu, et al. A penalty function method based on Kuhn-Tucker condition for solving linear bilevel programming, Applied Mathematics and Computation 188(2007), 808-813.
DOI
ScienceOn
|
12 |
C.Shi, G.Zhang, J.Lu. On the definition of linear bilevel programming solutin, Applied Mathematics and Computation 160(2005), 169-173.
DOI
ScienceOn
|