Genetic Algorithm for Solving Quadratic Bilevel Programming Problem

作     者：WANG Guangmin WAN Zhongping WANG Xianjiai FANG Debin 

作者机构：School of Water Resource and Hydropower Wuhan University Wuhan 430072 Hubei China School of Mathematics and Statistics Wuhan UniversityWuhan 430072 Hubei China School of Economics and Management Wuhan UniversityWuhan 430072 Hubei China 

出 版 物：《Wuhan University Journal of Natural Sciences》 (武汉大学学报（自然科学英文版）)

年 卷 期：2007年第12卷第3期

页      面：421-425页

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070105[理学-运筹学与控制论] 0701[理学-数学] 

基　　金：Supported by the National Natural Science Foundation of China (70371032 60574071) 

主　　题：quadratic bilevel programming genetic algorithm optimal solution 

摘      要：By applying Kuhn-Tucker condition the quadratic bilevel programming, a class of bilevel programming, is transformed into a single level programming problem, which can be simplified by some rule. So we can search the optimal solution in the feasible region, hence reduce greatly the searching space. Numerical experiments on several literature problems show that the new algorithm is both feasible and effective in practice.