http://www.ksme.info
PDF
Subdifferentiability of a vector-valued set function is defined first. Then in terms of zero-like functions, a perperly efficient solution of a convex programming problem with set functions will be characterized.