Higher order symmetric duality for multiobjective fractional programming problems over cones | Zendy

Arshpreet Kaur | Zendy; M. K. Sharma | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Higher order symmetric duality for multiobjective fractional programming problems over cones

Author(s) -

Arshpreet Kaur,

M. K. Sharma

Publication year - 2021

Publication title -

yugoslav journal of operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.221

H-Index - 21

eISSN - 1820-743X

pISSN - 0354-0243

DOI - 10.2298/yjor200615012k

Subject(s) - duality (order theory) , mathematics , fractional programming , order (exchange) , strong duality , dual (grammatical number) , weak duality , wolfe duality , duality gap , second order cone programming , cone (formal languages) , set (abstract data type) , mathematical optimization , regular polygon , combinatorics , convex optimization , nonlinear programming , optimization problem , computer science , physics , algorithm , nonlinear system , art , literature , geometry , quantum mechanics , programming language , finance , economics

This article studies a pair of higher order nondifferentiable symmetric fractional programming problem over cones. First, higher order cone convex function is introduced. Then using the properties of this function, duality results are set up, which give the legitimacy of the pair of primal dual symmetric model.

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