Based on the result that a global optimal solution to linear bilevel programming occurs at the extreme point of its constraint regain, uses adjacent extreme point to get the cutting plane and designs a cutting plane algorithm for solving linear bilevel programming with the upper-level constraint. And a simple example is given to illustrate the application of the algorithm.