A novel penalty function method for semivectorial bilevel programming problem

Abstract The bilevel problem is usually much more difficult to solve than the single level problem. If the bilevel problem can be transformed into a single level problem, it will be much easier for one to design effective algorithms. In this paper, a novel penalty function method for semivectorial bilevel programming problem is proposed. First, based on Benson’s method and dual theory of linear programming, the semivectorial bilevel programming problem is transformed into a single level optimization problem by setting the dual gap of the lower level problem to zero; then the transformed problem is further relaxed in order to make the transformed problem solving easier; furthermore, a twice differentiable function called dual gap indicator is designed and a penalty function is constructed by using the dual gap indicator as the penalty term for the relaxed transformed problem. Based on all these, a new penalty function method is proposed, and the solution of the penalty problem can be proved to be the solution of the original problem under mild conditions. Finally, numerical examples are provided to demonstrate the good performance of the proposed algorithm.

[1]  D. White,et al.  A solution method for the linear static Stackelberg problem using penalty functions , 1990 .

[2]  Stephan Dempe,et al.  Foundations of Bilevel Programming , 2002 .

[3]  Simone Dantas,et al.  A Note on a Penalty Function Approach for Solving Bilevel Linear Programs , 2000, J. Glob. Optim..

[4]  Stephan Dempe,et al.  Linear bilevel programming with upper level constraints depending on the lower level solution , 2006, Appl. Math. Comput..

[5]  Alexander S. Strekalovsky,et al.  On computational search for optimistic solutions in bilevel problems , 2010, J. Glob. Optim..

[6]  Wan Zhongping,et al.  A dual-relax penalty function approach for solving nonlinear bilevel programming with linear lower level problem , 2011 .

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

[8]  Stephan Dempe,et al.  New Optimality Conditions for the Semivectorial Bilevel Optimization Problem , 2012, Journal of Optimization Theory and Applications.

[9]  S. Scholtes,et al.  Exact Penalization of Mathematical Programs with Equilibrium Constraints , 1999 .

[10]  H. P. Benson,et al.  Optimization over the efficient set , 1984 .

[11]  F. Galiana,et al.  Nodal price control: a mechanism for transmission network cost allocation , 2006, IEEE Transactions on Power Systems.

[12]  Zhiqing Meng,et al.  A second-order smooth penalty function algorithm for constrained optimization problems , 2013, Comput. Optim. Appl..

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

[14]  Zhiyou Wu,et al.  Quadratic smoothing approximation to $l_1$ exact penalty function in global optimization , 2005 .

[15]  Xiaoqi Yang,et al.  On the Smoothing of the Square-Root Exact Penalty Function for Inequality Constrained Optimization , 2006, Comput. Optim. Appl..

[16]  Mihai Anitescu,et al.  On Using the Elastic Mode in Nonlinear Programming Approaches to Mathematical Programs with Complementarity Constraints , 2005, SIAM J. Optim..

[17]  Jianzhong Zhang,et al.  A Bilevel Programming Method for Pipe Network Optimization , 1996, SIAM J. Optim..

[18]  Paul H. Calamai,et al.  Bilevel and multilevel programming: A bibliography review , 1994, J. Glob. Optim..

[19]  Patrice Marcotte,et al.  Bilevel programming: A survey , 2005, 4OR.

[20]  Chuangyin Dang,et al.  An Objective Penalty Function of Bilevel Programming , 2012, J. Optim. Theory Appl..

[21]  J. Z. Zhang,et al.  Exact Penalty Functions for Convex Bilevel Programming Problems , 2001 .

[22]  Yacov Y. Haimes,et al.  Multiobjective Decision Making: Theory and Methodology , 1983 .

[23]  Herminia I. Calvete,et al.  A Multiobjective Bilevel Program for Production-Distribution Planning in a Supply Chain , 2008, MCDM.

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

[25]  Zhongping Wan,et al.  A solution method for semivectorial bilevel programming problem via penalty method , 2011 .

[26]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[27]  Athanasios Migdalas,et al.  A novel approach to Bilevel nonlinear programming , 2007, J. Glob. Optim..

[28]  Kin Keung Lai,et al.  Manufacturer's revenue-sharing contract and retail competition , 2008, Eur. J. Oper. Res..

[29]  Xiaoning Zhang,et al.  Stackelberg games and multiple equilibrium behaviors on networks , 2007 .

[30]  Z. Ankhili,et al.  An exact penalty on bilevel programs with linear vector optimization lower level , 2009, Eur. J. Oper. Res..

[31]  Herminia I. Calvete,et al.  Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm , 2008 .

[32]  Ichiro Nishizaki,et al.  Cooperative and Noncooperative Multi-Level Programming , 2009 .

[33]  M. Friedlander,et al.  An interior-point method for mpecs based on strictly feasible relaxations , 2004 .

[34]  J. Clegg,et al.  Bilevel programming applied to optimising urban transportation , 2001 .

[35]  Stephan Dempe,et al.  Is bilevel programming a special case of a mathematical program with complementarity constraints? , 2012, Math. Program..

[36]  Tiesong Hu,et al.  A penalty function method based on Kuhn-Tucker condition for solving linear bilevel programming , 2007, Appl. Math. Comput..

[37]  Patrice Marcotte,et al.  An overview of bilevel optimization , 2007, Ann. Oper. Res..

[38]  J. Morgan,et al.  Semivectorial Bilevel Optimization Problem: Penalty Approach , 2006 .

[39]  Stephan Dempe,et al.  Direct search algorithm for bilevel programming problems , 2011, Comput. Optim. Appl..

[40]  S. Dempe.  Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints , 2003 .