E-Duality Results For E-Differentiable E-Invex Multiobjective Programming Problems | Zendy

Najeeb Abdulaleem | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

E-Duality Results For E-Differentiable E-Invex Multiobjective Programming Problems

Author(s) -

Najeeb Abdulaleem

Publication year - 2019

Publication title -

journal of physics conference series

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.21

H-Index - 85

eISSN - 1742-6596

pISSN - 1742-6588

DOI - 10.1088/1742-6596/1294/3/032027

Subject(s) - differentiable function , duality (order theory) , multiobjective programming , mathematics , wolfe duality , pure mathematics , strong duality , mathematical optimization , optimization problem , weak duality , multi objective optimization

In this paper, a class of E-differentiable multiobjective programming problems with both inequality and equality constraints is considered. The so-called vector Mond-Weir E-dual problem and vector mixed E-duality problem are defined for the considered E-differentiable multiobjective programming problem with both inequality and equality constraints and several Mond-Weir and mixed E-duality theorems are established under (generalized) E-invexity hypotheses.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research