On implicit function theorems for set-valued maps and their application to mathematical programming under inclusion constraints

In this paper we establish some implicit function theorems for a class of locally Lipschitz set-valued maps and then apply them to investigate some questions concerning the stability of optimization problems with inclusion constraints. In consequence we have an extension of some of the corresponding results of Robinson, Aubin, and others.