We present a general method for approximating the considered bilevel programming problem by using asequence of bilevel optimization problems, and get some interesting results of this approach.

• 我们给出了由一系列此类二层规划去逼近原二层规划的逼近法，得到了这种逼近的一些有趣的结果.