THE EXACT PENALTY FUNCTION OF NONSMOOTH PROGRAMMING
非光滑规划的精确罚函数

In this paper,the exact penalty function theory of nonsmooth programming with both e-quality and inequality constraints(?)is discussed.The main results are the following:Suppose X is a compact set,the number of global optimal solution sets of the originalproblem is finite.Under appropriate restrictions,the global exact penalty function exists.Especially,a 1-1 correspondence between the solutions of the original problem and its exactpenalty function problem is set up.Two evaluation theorems for penalty parameters are established.