A Note on Constrained Qualification for Bilevel Programming
Received:January 03, 1996  
Key Words: Bilevel programming   Kuhn Tucker condition   constrained qualification   partial calmness.  
Fund Project:
Author NameAffiliation
Yang Qingzhi Graduate
University of Science and Technology of China
Beijing 100039 
Hits: 1910
Download times: 964
      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.
View Full Text  View/Add Comment  Download reader