Search

Interval programming is one of main approaches treating imprecise and uncertain elements involved in optimization problems. In this paper, an interval linear fractional bilevel program is considered, which is characterized in that both objective coefficients and the right-hand side vector are interval numbers, and an evolutionary algorithm (EA) is proposed to solve the problem. First, the interval parameter space of the follower's problem is taken as the search space of the proposed EA. For each individual, one can evaluate it by dealing with a simplified interval bilevel program in which only the leader's objective involves interval parameters. In addition, the optimality conditions of linear fractional programs are applied to convert and solve the simplified problem. Finally, some computational examples were solved and the results show that the proposed algorithm is efficient and robust. [ABSTRACT FROM AUTHOR]