Oil minmax programming problems containing n-set functions
Vasile Preda · Optimization · 1991
In this paper, we prove that some sufficient optimality conditions and several duality results of Zalmai [24] are true under more general assumptions than convexity. Here, the generalized convexity is defined by use of sublinear functionals which satisfy certain convexity-type conditions.