Treffer: Nondifferentiable multiobjective programming under generalized dI-invexity

Title:
Nondifferentiable multiobjective programming under generalized dI-invexity
Source:
European journal of operational research. 202(1):32-41
Publisher Information:
Amsterdam: Elsevier, 2010.
Publication Year:
2010
Physical Description:
print, 1/2 p
Original Material:
INIST-CNRS
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
Laboratory of Modeling and Optimization of Systems (LAMOS), Operational Research Department, University of Bejaia, 06000 Bejaia, Algeria
ISSN:
0377-2217
Rights:
Copyright 2015 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Operational research. Management
Accession Number:
edscal.22505586
Database:
PASCAL Archive

Weitere Informationen

In this paper, we are concerned with a nondifferentiable multiobjective programming problem with inequality constraints. We introduce new concepts of d1-invexity and generalized dI-invexity in which each component of the objective and constraint functions is directionally differentiable in its own direction d;. New Fritz-John type necessary and Karush―Kuhn―Tucker type necessary and sufficient optimality conditions are obtained for a feasible point to be weakly efficient, efficient or properly efficient. Moreover, we prove weak, strong, converse and strict duality results for a Mond-Weir type dual under various types of generalized dI-invexity assumptions.