Optimality and duality in multiobjective programming involving higher order semilocally strong convexity

Anurag Jayswal, Vivek Singh and I. Ahmad

International Journal of Mathematics in Operational Research, 2017, vol. 11, issue 2, 204-218

Abstract: In this paper, we propose a generalisation of convexity, namely higher order semilocally strong convexity for a nonlinear multiobjective programming problem, where the function involved are semidifferentiable. The generalised Karush-Kuhn-Tucker necessary and sufficient optimality conditions are derived. Moreover, a general Mond-Weir type dual problem is presented for nonlinear multiobjective programming problem involving higher order semilocally strong convexity and usual duality theorems are discussed.

Keywords: multiobjective programming; semilocally strongly convex; optimality conditions; duality; strict minimiser of order m . (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=86307 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:11:y:2017:i:2:p:204-218

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().