Weak Pseudo-Invexity and Characterizations of Solutions in Multiobjective Programming

Authors

Hachem Slimani, LaMOS Research Unit, Computer Science Department, University of Bejaia, 06000 Bejaia, AlgeriaFollow
Mohammed Said Radjef, LaMOS Research Unit, Operational Research Department, University of Bejaia, 06000 Bejaia, AlgeriaFollow

Author Country (or Countries)

Algeria

Abstract

In this paper, we study Fritz John type optimality for nonlinear multiobjective programming problems under new classes of generalized invex vector functions. Relationships between these classes of vector functions are established by giving several examples. Furthermore, optimality conditions and characterizations of efficient and weakly efficient solutions are obtained under weak pseudoinvexity and by using a concept of generalized Fritz John vector critical point. We have illustrated through various non-trivial examples that the results obtained in this paper extend many previously known results in this area.

Digital Object Identifier (DOI)

http://dx.doi.org/10.18576/amis/100313

Recommended Citation

Slimani, Hachem and Said Radjef, Mohammed (2016) "Weak Pseudo-Invexity and Characterizations of Solutions in Multiobjective Programming," Applied Mathematics & Information Sciences: Vol. 10: Iss. 3, Article 13.
DOI: http://dx.doi.org/10.18576/amis/100313
Available at: https://digitalcommons.aaru.edu.jo/amis/vol10/iss3/13