Nader Kanzi

TL;DR: By imposing assumptions of generalized convexity, this paper gives sufficient conditions for efficient solutions for nonsmooth multiobjective semi-infinite programming problems in which the index set of the inequality constraints is an arbitrary set not necessarily finite.

TL;DR: Several kinds of constraint qualifications for non-smooth semi-infinite programming problems in which the index set of the inequality constraints is an arbitrary set not necessarily finite are introduced.

TL;DR: In this article, for a nonsmooth semi-infinite programming problem where the objective and constraint functions are locally Lipschitz, analogues of the Guignard, Kuhn-Tucker, and Cottle constraint qualifications are given.

TL;DR: In this article, the authors considered a nonsmooth semi-infinite programming problem with a feasible set defined by inequality and equality constraints and a set constraint, and applied alternative theorems to obtain, under different constraint qualifications, several necessary optimality conditions in the type of Fritz-John and Karush-Kuhn-Tucker.

TL;DR: New and already known data qualifications are introduced in order to get optimality conditions which are expressed in terms of either Karusk–Kuhn–Tucker multipliers or a new gap function associated with the given problem.