-

Bi-level programming, a tool for modeling decentralized decision problem, consists of the objective of the leader at its first level and that of the follower at the second level. Bi-level programming has been proved to be Np_hard problem. Numerous algorithms have been developed for solving bi-level programming problem. These algorithms have not enough efficiency for solving a real problem. In this paper an attempt has been made to develop an algorithm based on Tabu
Search (TS) approach. This algorithm can be efficient to finding a near optimal solution. In this paper, the proposed method and that of Mathieu and et.el [1]
are also compared by solving different problems.