Duality for second-order symmetric multiobjective programming with cone constraints (Q1753742)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Duality for second-order symmetric multiobjective programming with cone constraints |
scientific article; zbMATH DE number 6875982
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Duality for second-order symmetric multiobjective programming with cone constraints |
scientific article; zbMATH DE number 6875982 |
Statements
Duality for second-order symmetric multiobjective programming with cone constraints (English)
0 references
29 May 2018
0 references
Summary: In this paper, a new pair of Mond-Weir type multiobjective second-order symmetric dual models with cone constraints is formulated in which the objective function is optimised with respect to an arbitrary closed convex cone. Usual duality relations are further established under \(K-\eta\)-bonvexity/second-order symmetric dual \(K-H\)-convexity assumptions. A nontrivial example has also been illustrated to justify the weak duality theorems. Several results including many recent works are obtained as special cases.
0 references
symmetric duality
0 references
\(K-\eta\)-bonvexity
0 references
second-order \(K-H\)-convexity
0 references
multiobjective programming
0 references
cone
0 references