Genetic Algorithm for Solving Convex Quadratic Bilevel Programming Problem
This paper presents a genetic algorithm method for solving convex quadratic bilevel programming problem. Bilevel programming problems arise when one optimization problem, the upper problem, is constrained by another optimization, the lower problem. In this paper, the bilevel convex quadratic problem is transformed into a single level problem by applying Kuhn-Tucker conditions, and then an … Read more