Sufficiency criteria and duality for nonlinear programs involving n-set functions (Q752017)

Presented are several sufficiency and duality results for a nonlinear programming problem involving n-set functions: minimize \(F(S_ 1,...,S_ n)\) subject to \(G_ 1(S_ 1,...,S_ n)\leq 0\),..., \(G_ m(S_ 1,...,S_ n)\leq 0\); here \(S_ 1,...,S_ n\) are subsets of a given set, and F and \(G_ 1,...,G_ m\) are real valued functions. The results are established in terms of differentiability and convexity for n-set functions [see \textit{H. W. Corley}, ibid. 127, No.1, 193-205 (1987; Zbl 0715.90096)], notions, which were originally introduced for set functions by \textit{R. J. T. Morris} [ibid. 70, No.2, 546-562 (1979; Zbl 0417.49032)]. The sufficiency and duality results contain as special cases the counterparts of most of the well-known results obtained for conventional nonlinear programming problems with differentiable data.