Generalized K-T conditions and penalty functions for quasidifferentiable programming

In this paper, a quasidifferentiable programming problem with inequality constraints is considered. First, a general form of optimality conditions for this problem is given, which contains the results of Luderer, Kuntz and Scholtes. Next, a new generalized K-T condition is derived. The new optimality condition doesn’t use Luderer’s regularity assumption and its Lagrangian multipliers don’t depend on the particular elements in the superdifferentials of the object function and constraint functions. Finally, a penalty function for the problem is studied. Sufficient conditions of the penalty function attaining a global minimum are obtained.