Optimality conditions for nonsmooth semi-infinite multiobjective programming

Abstract

This paper is devoted to the study of nonsmooth multiobjective semi-infinite programming problems in which the index set of the inequality constraints is an arbitrary set not necessarily finite. We introduce several kinds of constraint qualifications for these problems, and then necessary optimality conditions for weakly efficient solutions are investigated. Finally by imposing assumptions of generalized convexity we give sufficient conditions for efficient solutions. © 2013 Springer-Verlag Berlin Heidelberg.