On semi-G-V-type I concepts for directionally differentiable multiobjective programming problems | Zendy

Tadeusz Antczak | Zendy; Gabriel Ruiz Garzón | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On semi-G-V-type I concepts for directionally differentiable multiobjective programming problems

Author(s) -

Tadeusz Antczak,

Gabriel Ruiz Garzón

Publication year - 2016

Publication title -

an international journal of optimization and control theories and applications (ijocta)

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.287

H-Index - 6

eISSN - 2146-5703

pISSN - 2146-0957

DOI - 10.11121/ijocta.01.2016.00282

Subject(s) - differentiable function , mathematics , duality (order theory) , type (biology) , converse , mathematical optimization , multiobjective programming , class (philosophy) , pure mathematics , multi objective optimization , computer science , artificial intelligence , ecology , geometry , biology

In this paper, a new class of nonconvex nonsmooth multiobjective programming problems with directionally differentiable functions is considered. The so-called G-V-type I objective and constraint functions and their generalizations are introduced for such nonsmooth vector optimization problems. Based upon these generalized invex functions, necessary and sufficient optimality conditions are established for directionally differentiable multiobjective programming problems. Thus, new Fritz John type and Karush-Kuhn-Tucker type necessary optimality conditions are proved for the considered directionally differentiable multiobjective programming problem. Further, weak, strong and converse duality theorems are also derived for Mond-Weir type vector dual programs.

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