Условия оптимальности для негладких задач выпуклого программирования

Abstract

In the article, we consider nonsmooth convex programming problems of special type. Such a class of problems arises in studies of convex semi-infinite programming problems that do not satisfy regularity conditions. For the class of mathematical programming problems under consideration, new optimality conditions of dual type are proved. These conditions are the optimality conditions for the corresponding semi-infinite programming problem as well.