Acta mathematica scientia,Series A ›› 2011, Vol. 31 ›› Issue (3): 585-593.

• Articles •     Next Articles

ε-exact Penalty for Non-concave Bilevel Programming Problems

 LI Chang-Min1, ZHU Dao-Li2   

  1. 1.School of  |Management, Fudan University, Shanghai 200433|2.School of Economics and Management, Tongji University, Shanghai 200092
  • Received:2009-05-08 Revised:2010-06-10 Online:2011-06-25 Published:2011-06-25
  • Supported by:

    国家自然科学基金(71071035)资助

Abstract:

The main tool in the present literature  to treat the bilevel programming problems (BLPP)  is the method of  KKT conditions and value function. However, for the non-concave case, neither  technique can  be applied. In this paper,  the authors introduce the notions of
ε-set, ε-error bounds, and use certain ε-uniform error bounds as ε-exact penalties to give single  level problems equivalent to the approximate BLPP. Furthermore, they show that any cluster of the approximate sequence is  the solution of the BLPP.

Key words: Non-concave bilevel programming problems,  ε-error bound,  ε-exact penalty, Convergence

CLC Number: 

  • 90C26
Trendmd