[1] Anandalingam G, White D J. A solution for the linear static Stackelberg problem using penalty function. IEEE Transactions Automatic Control, 1990, 35: 1170--1173
[2] Bard J F. Practical Bilevel Optimization:Algorithms and Applications. Dordrecht: Kluwer Academic Publishers, 1998
[3] Campêlo M, Dantas S, Scheimberg S. A note on a penalty function approach for solving bilevel linear programs. Journal of Global Optimization, 2000, 16: 245--255
[4]Colson B, Marcotte P, Savard G. Bilevel programming: a survey. 4OR Quarterly Journal of Operations Research, 2005, (3): 87--107
[5]Dempe S. Foundations of Bilevel Programming. Kluwer Academic Publishers, 2002
[6]Dempe S. Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints. Optimization, 2003, 52: 333--359
[7]Liu G, Han J, Zhang J. Exact penalty functions for convex bilevel programming problems. Journal of Optimization Theory and Applications, 2001, 110: 621--643
[8]Lv Y, Hu T, Wang G, Wan Z. A penalty function method based on Kuhn-Tucker condition for solving linear bilevel programming. Applied Mathematics and Computation, 2007, 188: 808--813
[9]Meng Z, Dang C, Yang X. On the Smoothing of the Square-Root Exact Penalty Function for Inequality Constrained Optimization. Computational Optimization and Applications, 2006, 35: 375--398
[10]Migadalas A, Paradalos P M, Värbraud P. Multilevel Optimization Algorithms and Applications. Kluwer Academic Publishers, 1998
[11]Vicente L N, Calamai P H. Bilevel and multibilevel programming: a bibliography review. Journal of Global Optimization, 1994, (5): 291--306
[12]Wan Z, Zhou S. The convergence of approach penalty function method for approximate bilevel programming problem. Acta Mathematica Scientia, 2001, 21: 69--76
[13]Wen U P, Hsu S T. Linear bilevel programming problem - a review. Journal of the Operational Research Society, 1991, 42: 125--133
[14] White D J, Anandalingam G. A penalty function approach for solving bi-level linear programs. Journal of Global Optimization, 1993, (3): 397--419 |