A New Genetic Algorithm for Nonlinear Bilevel Programming Problem and Its Global Convergence
解非线性两层规划问题的新的遗传算法及全局收敛性

It is very difficult to determine its solution of bilevel programming problem because of its inherent nonconvexity and nondifferentiability. In particular, it is more difficult to get the global optimal solution of nonlinear bilevel programming problem. But Genetic algorithm has no restrictions on functions involved such as differentiability, convexity and so on. So a new kind of the effective Genetic algorithm for nonlinear bilevel programming problem is presented. This algorithm sufficiently utilizes the specific structure of the problem, such that genetic operator is more effective and better offspring can be produced easily. The theoretical analysis and the numerical simulations show that the new algorithm is used not only simply and easily but also effectively.