In this paper we research the constrained qualification for Bilevel programming. We show that the usual constrained qualifications in nonlinear programming fail to hold for more general Bilevel Program, and then we gi...In this paper we research the constrained qualification for Bilevel programming. We show that the usual constrained qualifications in nonlinear programming fail to hold for more general Bilevel Program, and then we give a sufficient condition of “partial calmness” which is weak constrained qualification and can be satisfied for some Bilevel Programs.展开更多
文摘In this paper we research the constrained qualification for Bilevel programming. We show that the usual constrained qualifications in nonlinear programming fail to hold for more general Bilevel Program, and then we give a sufficient condition of “partial calmness” which is weak constrained qualification and can be satisfied for some Bilevel Programs.
