J4 ›› 2011, Vol. 49 ›› Issue (04): 625-632.

Previous Articles     Next Articles

A Grey Linear Bilevel Programming Problem withMultiple Independent Followers and Its Algorithm

LIU Bingbing1, GUO Yajun2   

  1. 1. School of Mathematics and Computing Science, Anqing Teachers College, |Anqing 246133, Anhui Province, China|2. School of Mathematics &|Information Technology, |Hebei Normal University of Science &|Technology, Qinhuangdao 066004, Hebei Province, China
  • Received:2010-08-27 Online:2011-07-26 Published:2011-08-16
  • Contact: LIU Bingbing E-mail:lbb122400@gmail.com

Abstract:

Based on the linear bilevel programming problem with multiple independent  followers and the characteristic of grey system, a grey linear bilevel programming problem with multiple independent followers (GLBMIF) was put forward, and its model was given. We showed that the drifting grey linear bilevel  programming problem with multiple independent followers (GLBMIF(θ)) is 
equivalent to the drifting grey linear bilevel programming problem. An algorithm based on simplex method was developed to solve the GLBMIF (θ). A numerical example shows that the proposed algorithm is feasible and effective.

Key words: linear bilevel programming, grey system, multiple independent followers; , simplex method

CLC Number: 

  • O221.1