An augmented Lagrangian multiplier method based on a CHKS smoothing function for solving nonlinear bilevel programming problems

Bilevel programming techniques deal with decision processes involving two decision makers with a hierarchical structure. In this paper, an augmented Lagrangian multiplier method is proposed to solve nonlinear bilevel programming (NBLP) problems. An NBLP problem is first transformed into a single level problem with complementary constraints by replacing the lower level problem with its Karush-Kuhn-Tucker optimality condition, which is sequentially smoothed by a Chen-Harker-Kanzow-Smale (CHKS) smoothing function. An augmented Lagrangian multiplier method is then applied to solve the smoothed nonlinear program to obtain an approximate optimal solution of the NBLP problem. The asymptotic properties of the augmented Lagrangian multiplier method are analyzed and the condition for solution optimality is derived. Numerical results showing viability of the approach are reported.

[1]  L. N. Vicente,et al.  Descent approaches for quadratic bilevel programming , 1994 .

[2]  Mahyar A. Amouzegar.  A global optimization method for nonlinear bilevel programming problems , 1999, IEEE Trans. Syst. Man Cybern. Part B.

[3]  M. Hestenes.  Multiplier and gradient methods , 1969 .

[4]  Mohammad Mehdi Sepehri,et al.  Linear bilevel programming solution by genetic algorithm , 2002, Comput. Oper. Res..

[5]  Olvi L. Mangasarian,et al.  Smoothing methods for convex inequalities and linear complementarity problems , 1995, Math. Program..

[6]  Zhongping Wan,et al.  An approximate programming method based on the simplex method for bilevel programming problem , 2010, Comput. Math. Appl..

[7]  R. J. Kuo,et al.  Application of particle swarm optimization algorithm for solving bi-level linear programming problem , 2009, Comput. Math. Appl..

[8]  R. J. Kuo,et al.  A hybrid of genetic algorithm and particle swarm optimization for solving bi-level linear programming problem – A case study on supply chain model , 2011 .

[9]  M. J. D. Powell,et al.  A method for nonlinear constraints in minimization problems , 1969 .

[10]  Herminia I. Calvete,et al.  On linear bilevel problems with multiple objectives at the lower level , 2011 .

[11]  Zhongping Wan,et al.  A globally convergent algorithm for a class of bilevel nonlinear programming problem , 2007, Appl. Math. Comput..

[12]  Tao Yan,et al.  A class of smoothing methods for mathematical programs with complementarity constraints , 2007, Appl. Math. Comput..

[13]  Jie Lu,et al.  On bilevel multi-follower decision making: General framework and solutions , 2006, Inf. Sci..

[14]  U. Wen,et al.  A simple Tabu Search method to solve the mixed-integer linear bilevel programming problem , 1996 .

[15]  Charles E. Blair,et al.  Computational Difficulties of Bilevel Linear Programming , 1990, Oper. Res..

[16]  Ue-Pyng Wen,et al.  A hybrid neural network approach to bilevel programming problems , 2007, Appl. Math. Lett..

[17]  Herminia I. Calvete,et al.  Bilevel model for production-distribution planning solved by using ant colony optimization , 2011, Comput. Oper. Res..

[18]  M. Florian,et al.  THE NONLINEAR BILEVEL PROGRAMMING PROBLEM: FORMULATIONS, REGULARITY AND OPTIMALITY CONDITIONS , 1993 .

[19]  J. Pang,et al.  Convergence of a Smoothing Continuation Method for Mathematical Progams with Complementarity Constraints , 1999 .

[20]  Zhongping Wan,et al.  A hybrid intelligent algorithm by combining particle swarm optimization with chaos searching technique for solving nonlinear bilevel programming problems , 2013, Swarm Evol. Comput..

[21]  Bintong Chen,et al.  A Non-Interior-Point Continuation Method for Linear Complementarity Problems , 1993, SIAM J. Matrix Anal. Appl..

[22]  Zhongping Wan,et al.  Genetic algorithm based on simplex method for solving linear-quadratic bilevel programming problem , 2008, Comput. Math. Appl..

[23]  Jean Bosco Etoa Etoa.  Solving quadratic convex bilevel programming problems using a smoothing method , 2011, Appl. Math. Comput..

[24]  Ue-Pyng Wen,et al.  A neural network approach to multiobjective and multilevel programming problems , 2004 .

[25]  Michel Gendreau,et al.  A hybrid Tabu-ascent algorithm for the linear Bilevel Programming Problem , 1996, J. Glob. Optim..

[26]  J. Bard.  Some properties of the bilevel programming problem , 1991 .

[27]  Christodoulos A. Floudas,et al.  Global Optimization of Nonlinear Bilevel Programming Problems , 2001, J. Glob. Optim..

[28]  Jonathan F. Bard,et al.  Practical Bilevel Optimization: Algorithms and Applications , 1998 .

[29]  Stefan Scholtes,et al.  Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity , 2000, Math. Oper. Res..

[30]  Xiaojun Chen.  SMOOTHING METHODS FOR COMPLEMENTARITY PROBLEMS AND THEIR APPLICATIONS : A SURVEY , 2000 .

[31]  Francisco Facchinei,et al.  A smoothing method for mathematical programs with equilibrium constraints , 1999, Math. Program..