Title of article
A characterization of pseudoinvexity in multiobjective programming
Author/Authors
Arana-Jiménez، نويسنده , , M. and Rufiلn-Lizana، نويسنده , , A. and Osuna-Gَmez، نويسنده , , R. and Ruiz-Garzَn، نويسنده , , G.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
5
From page
1719
To page
1723
Abstract
In this paper, we introduce new classes of vector functions which generalize the class of scalar invex functions. We prove that these new classes of vector functions are characterized in such a way that every vector critical point is an efficient solution of a Multiobjective Programming Problem. We establish relationships between these new classes of functions and others used in the study of efficient and weakly efficient solutions.
Keywords
Efficient solution , invexity , Vector critical point , Weakly efficient solution , Pseudoinvexity , multiobjective programming
Journal title
Mathematical and Computer Modelling
Serial Year
2008
Journal title
Mathematical and Computer Modelling
Record number
1595850
Link To Document