Higher-order duality for multiobjective programming problem involving  | Zendy

Anurag Jayswal | Zendy; Krishna Kummari | Zendy

Open Access

Higher-order duality for multiobjective programming problem involving <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/…

Author(s) -

Anurag Jayswal,

Krishna Kummari

Publication year - 2014

Publication title -

journal of the egyptian mathematical society

Language(s) - English

Resource type - Journals

eISSN - 2090-9128

pISSN - 1110-256X

DOI - 10.1016/j.joems.2014.01.002

Subject(s) - converse , duality (order theory) , mathematics , order (exchange) , xml , function (biology) , support function , pure mathematics , algebra over a field , computer science , regular polygon , convex optimization , world wide web , subderivative , geometry , finance , evolutionary biology , economics , biology

In the present article, we formulate two different kinds of higher-order dual models related to the multi-objective programming problem containing arbitrary norms. Furthermore, weak, strong and strict converse duality results are established under the assumptions of higher-order (Φ,ρ)-invex function. Results obtained in this paper unify and extend some previously known results in the literature

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