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.
Original language | English |
---|---|
Pages (from-to) | 204-218 |
Number of pages | 15 |
Journal | International Journal of Mathematics in Operational Research |
Volume | 11 |
Issue number | 2 |
DOIs | |
State | Published - 2017 |
Bibliographical note
Publisher Copyright:Copyright © 2017 Inderscience Enterprises Ltd.
Keywords
- Duality
- Multiobjective programming
- Optimality conditions
- Semilocally strongly convex
- Strict minimiser of order m
ASJC Scopus subject areas
- Decision Sciences (all)
- Modeling and Simulation