Date: 15 Nov 2012

An exact penalty method for weak linear bilevel programming problem

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


In this paper, we present an exact penalty method, which is different from the existing penalty method, for solving weak linear bilevel programming problem. Then, we establish an existence result of solutions for such a problem. Finally, we propose an algorithm and give two examples to illustrate its feasibility.

Supported by the National Science Foundation of China (71171150, 71201146) and the Ph.D. Fund of Huanggang Normal University to Yue Zheng.