An Algorithm Genetic Approach for solving Bi-level Linear Programming

Bi-level programming (BLP), is one of the important problems in the decision-making theory, is multilevel programming with two levels. It involves two optimization problems where the constraint region of the first level problem is implicitly determined by another optimization problem. Since the BLP problem is NP-hard, it is impossible solving it by traditional methods. This paper reviews the BLP problem and applies enumeration techniques for finding extreme points. It uses the genetic algorithm for the searching region and finding the optimum solution. Also, the search region is controlled by a parameter in order to avoid the increased time. The results show that the solutions are acceptable in comparison with previous studies.