Optimality and duality in multiobjective programming involving higher order semilocally strong convexity (Q2204316)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimality and duality in multiobjective programming involving higher order semilocally strong convexity |
scientific article |
Statements
Optimality and duality in multiobjective programming involving higher order semilocally strong convexity (English)
0 references
15 October 2020
0 references
Summary: 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.
0 references
multiobjective programming
0 references
semilocally strongly convex
0 references
optimality conditions
0 references
duality
0 references
strict minimiser of order \(m\)
0 references
