The paper presents •-optimality criteria for convex programming problems associated with exact penalty functions. Several authors have given various criteria under the assumption that such convex problems and the associated dual problems can be solved. The paper assumes the solvability of neither the convex problem nor the dual problem. To derive the present criteria, it estimates the size of the penalty parameter in terms of an •-solution for the dual problem.
