Axiomatic approach to duality in optimization (Q4029145)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 126463
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Axiomatic approach to duality in optimization |
scientific article; zbMATH DE number 126463 |
Statements
Axiomatic approach to duality in optimization (English)
0 references
7 March 1993
0 references
efficient point
0 references
monotonic function
0 references
vectorial, nonconvex optimization
0 references
weak duality axiom
0 references
vectorial optimization
0 references
0.8171967267990112
0 references
0.8161400556564331
0 references
0.8019680380821228
0 references
This research work is devoted to an original approach for the construction of the appropriate duality in vectorial, nonconvex optimization problems with objective maps multifunctions taking their values in a real vector space ordered by a convex and pointed cone. In this respect the authors use a weak duality axiom coupled with a separation result of nonconvex sets with respect to monotonic functions. They establish strong duality relations without convexity and without a weak constraint qualification, with applications in strong, nonconvex optimization problems and in vectorial optimization programming. Following the new duality, the authors present finally some applications for which the classical duality is not applicable.
0 references
