On minmax programming problems containing n-set functions

On minmax programming problems containing n-set functions

0.00 Avg rating0 Votes
Article ID: iaor1992715
Country: Germany
Volume: 22
Start Page Number: 527
End Page Number: 537
Publication Date: Aug 1991
Journal: Optimization
Authors:
Abstract:

This paper proves that some sufficient optimality conditions and several duality results of Zalmai 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.

Reviews

Required fields are marked *. Your email address will not be published.