A penalty function method for solving ill-posed bilevel programming problem via weighted summation

2013 ◽  
Vol 26 (6) ◽  
pp. 1019-1027 ◽  
Author(s):  
Shihui Jia ◽  
Zhongping Wan





Filomat ◽  
2014 ◽  
Vol 28 (8) ◽  
pp. 1619-1627 ◽  
Author(s):  
Yue Zheng ◽  
Jiawei Chen ◽  
Xiaogang Cao

In this paper, we consider a class of semivectorial bilevel programming problem. An exact penalty function is proposed for such a problem. Based on this penalty function, an algorithm, which can obtain a global solution of the original problem, is presented. Finally, some numerical results illustrate its feasibility.



2017 ◽  
Author(s):  
K. M. Bregman ◽  
M. P. Petrov ◽  
A. A. Trusov ◽  
A. V. Voitylov ◽  
V. V. Vojtylov


2013 ◽  
Vol 411-414 ◽  
pp. 1943-1947 ◽  
Author(s):  
Shi Hui Jia ◽  
Yue Zheng

This paper studied the leader how to motivate the follower to maximize its interests for ill-posed linear bilevel programming problem. We first presented a coordination model and gived its corresponding penalty problem. Under some conditions, we established the result on the existence of the solution. Then, an algorithm was developed to obtain a coordination solution to the original bilevel programming problem. Finally, numerical results show that the proposed method is feasible.



Sign in / Sign up

Export Citation Format

Share Document