Higher-order duality for multiobjective programming problem involving ðU; qÞ-invex functions

Document Type : Original Article

Authors

Department of Applied Mathematics, Indian School of Mines, Dhanbad 826 004, Jharkhand, India

Abstract

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 ðU; qÞ-invex function. Results obtained in this paper unify and extend some previously
known results in the literature. 

Keywords