| Article ID: | iaor20001173 |
| Country: | China |
| Volume: | 10 |
| Issue: | 2 |
| Start Page Number: | 183 |
| End Page Number: | 192 |
| Publication Date: | Apr 1997 |
| Journal: | Journal of Systems Science and Complexity |
| Authors: | Han J.Y., Liu G.S. |
| Keywords: | bilevel optimization |
In this paper, the authors derive an exact penalty function for nonconvex bilevel programming problem based on its KS form. Based on this exact penalty function a sufficient condition for KS to be partially calm is presented and a necessary optimality condition for nonconvex bilevel programming problems is given. Some existing results about the differentiability of the value function of the lower level programming problem are extended and a sufficient condition for CRCQ to hold for VS form of BLPP with linear lower level programming problem is also given.