Operations Research Transactions ›› 2015, Vol. 19 ›› Issue (2): 29-36.doi: 10.15960/j.cnki.issn.1007-6093.2015.02.003

Previous Articles     Next Articles

A global optimization method for solving the linear semivectorial bilevel programming problem

LV Yibing1,*, WAN Zhongping2   

  1. 1. School of Information and Mathematics, Yangtze University, Jingzhou 434023, Hubei, China; 2. School of Mathematics and Statistics, Wuhan University, Wuhan 430072, China
  • Received:2014-08-29 Online:2015-06-15 Published:2015-06-15

Abstract:

In this paper, we are concerned with global optimization approach for solving the linear semivectorial bilevel programming (LSBP) problem. Using the duality gap of the lower level programs, we construct the corresponding penalized problem. By analyzing the relationships between the optimal solutions of the original problem and the vertices of the feasible region of the penalized problem, we transform the LSBP problem to a series of linear programming problems. Then, the global optimal solution of the LSBP problem can be obtained by solving a series of linear programming problems. The numerical results show that the algorithm proposed is feasible to the LSBP problem.

Key words: semivectorial bilevel programming, duality, penalty function, global optimization solution