Non-differentiable vector programming problem and duality for higher-order cone convex functions (Q1988536)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Non-differentiable vector programming problem and duality for higher-order cone convex functions |
scientific article |
Statements
Non-differentiable vector programming problem and duality for higher-order cone convex functions (English)
0 references
23 April 2020
0 references
A new class of higher-order cone convex functions over cones is introduced, which includes several classes of functions in the literature as particular cases. Using the properties of this kind of functions, the authors study non-differentiable multi-objective fractional programming problems containing support functions of a compact convex set. Both the primal problem and the Schaible dual mode are considered. Weak and strong duality theorems are obtained within the class of high-order cone convex functions over cones.
0 references
higher-order duality
0 references
higher-order cone convex function
0 references
support function
0 references
non-differentiable fractional vector program
0 references
Schaible dual
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
