Axiomatic approach to duality in optimization

From MaRDI portal





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.











This page was built for publication: Axiomatic approach to duality in optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4029145)