scispace - formally typeset
S

S. Nobakhtian

Researcher at University of Isfahan

Publications -  55
Citations -  531

S. Nobakhtian is an academic researcher from University of Isfahan. The author has contributed to research in topics: Constraint (information theory) & Duality (optimization). The author has an hindex of 13, co-authored 50 publications receiving 426 citations. Previous affiliations of S. Nobakhtian include McGill University.

Papers
More filters
Journal ArticleDOI

Optimality conditions for nonsmooth semi-infinite multiobjective programming

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.
Journal ArticleDOI

Optimality conditions for non-smooth semi-infinite programming

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.
Journal ArticleDOI

Nonsmooth semi-infinite programming problems with mixed constraints

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.
Journal ArticleDOI

Convexificators and strong Kuhn-Tucker conditions

TL;DR: Constant optimality conditions for nonsmooth multiobjective optimization problems are studied and Mangasarian-Fromovitz type constraint qualification and several other qualifications are proposed and their relationships are investigated.
Journal ArticleDOI

Necessary and sufficient conditions for nonsmooth mathematical programs with equilibrium constraints

TL;DR: In this article, a mathematical program with equilibrium constraints (MPEC) is formulated as a MPEC with complementarity constraints and a necessary optimality result for nonsmooth MPEC on any Asplund space is derived.