The linear Bilevel Programming Problem (BLP) is an instance of a linear hierarchical decision process where the lower level constraint set is dependent on decisions taken at the upper level. In this paper we propose to solve this NP-hard problem using an adaptive search method inspired from the Tabu Search methodology. Numerical results on large scale linear BLPs are presented.