Open AccessHigher order duality of multiobjective constrained ratio optimization problems
Author(s) -
Arshpreet Kaur,
Navdeep Kailey,
Mahesh Kumar Sharma
Publication year - 2019
Publication title -
filomat
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.449
H-Index - 34
eISSN - 2406-0933
pISSN - 0354-5180
DOI - 10.2298/fil1907985k
Subject(s) - mathematics , duality (order theory) , convexity , converse , order (exchange) , type (biology) , class (philosophy) , mathematical proof , dual (grammatical number) , function (biology) , strong duality , pure mathematics , mathematical optimization , optimization problem , computer science , art , ecology , geometry , literature , finance , artificial intelligence , evolutionary biology , financial economics , economics , biology
A new concept in generalized convexity, called higher order (C,?,?,?,d) type-I functions, is introduced. To show the existence of such type of functions, we identify a function lying exclusively in the class of higher order (C,?,?,?,d) type-I functions and not in the class of (C,?,?,?,d) type-I functions already existing in the literature. Based upon the higher order (C,?,?,?,d) type-I functions, the optimality conditions for a feasible solution to be an efficient solution are derived. A higher order Schaible dual has been then formulated for nondifferentiable multiobjective fractional programs. Weak, strong and strict converse duality theorems are established for higher order Schaible dual model and relevant proofs are given under the aforesaid function.