Higher-order duality for multiobjective programming problem involving ðU; qÞ-invex functions | ||
Journal of the Egyptian Mathematical Society | ||
Volume 23, Issue 1, 2015, Pages 12-19 PDF (593.78 K) | ||
Document Type: Original Article | ||
DOI: 10.1016/j.joems.2014.01.002 | ||
Authors | ||
Anurag Jayswal* ; Krishna Kummari | ||
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 | ||
Multiobjective programming; Efficiency; Higher-order(U,q)-invexity; Duality | ||
Statistics Article View: 46 PDF Download: 26 |