For a class of quadratic bilevel programming problems with interval objective coefficients in the leader's and lower's levels, a genetic algorithm with two fitness functions is presented. Firstly, the coefficient interval of the lower's level objective is taken as the search space of the genetic algorithm. After doing so, for each individual, the lower's level of the resulting problem doesn't involve interval coefficients; In addition, the optimality conditions of quadratic programming are used to further t...