Fenchel duality theorem in multiobjective programming problems with set functions (Q1429341)
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: Fenchel duality theorem in multiobjective programming problems with set functions |
scientific article; zbMATH DE number 2064699
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fenchel duality theorem in multiobjective programming problems with set functions |
scientific article; zbMATH DE number 2064699 |
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
0 references
0 references
0.92084503
0 references
0.91699994
0 references
0.91563404
0 references
