Fenchel duality theorem in multiobjective programming problems with set functions (Q1429341): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:55, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fenchel duality theorem in multiobjective programming problems with set functions |
scientific article |
Statements
Fenchel duality theorem in multiobjective programming problems with set functions (English)
0 references
18 May 2004
0 references
This paper derives a Fenchel duality theorem for a multiobjective programming problem with set functions. For this purpose the authors firstly propose to characterize the convexity of a vector-valued set function (suitably defined) through its epigraph. Then, the notion of conjugate for a vector-valued convex/concave set function is introduced. Afterwards, a Fenchel-type duality theorem in a multiobjective programming problem with set functions is established.
0 references
set functions
0 references
Fenchel duality theorem
0 references
