Conjugate duality for vector-maximization problems (Q624559)
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: Conjugate duality for vector-maximization problems |
scientific article; zbMATH DE number 5848863
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Conjugate duality for vector-maximization problems |
scientific article; zbMATH DE number 5848863 |
Statements
Conjugate duality for vector-maximization problems (English)
0 references
9 February 2011
0 references
The authors use the concept of conjugacy and contend that the conjugate of a polyhedral concave nondecreasing homogeneous function is also a polyhedral concave nondecreasing homogeneous function. In this way they extend the conjugate duality to a larger but closed class of maximization problems and obtain generalization of earlier result by the first author [Vietnam J. Math. 32, No. 2, 209--218 (2004; Zbl 1139.91356)]. The authors also apply conjugate duality for a vector-maximization problem. A conjugate dual for a given vector-optimization problem is formulated and it is claimed that the presented conjugate duality is involutary. Other results like characterizing (weak) Pareto efficient solutions are also discussed.
0 references
conjugate duality
0 references
vector-maximization problem
0 references
0 references
0 references
0.96691144
0 references
0.95128906
0 references
0.94450396
0 references
0.94424784
0 references
0.9437203
0 references
0.9412755
0 references
0.9378999
0 references
0.9368552
0 references