Exact penalty functions and Lagrange multipliers

This paper considers a class of nondifferentiable penalty functions associated with a Lipschitz programming problem with an abstract geometric constraint. It analyses the relationship between this class of functions and Kuhn-Tucker type necessary conditions for the programming problem. Under various alternative assumptions the paper gives lower and upper bounds for the controlling parameter of the penalty function. Finally, it extends the results obtained to a wider class of penalty functions.