Fenchel duality theorem in multiobjective programming problems with set functions

DOI10.1007/BF02936081MaRDI QIDQ1429341zbMATH OpenFDO

Authors Sanming Liu, Enmin Feng

Publication date 18 May 2004

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02936081

zbMATH Keywords

Fenchel duality theoremset functions

Mathematics Subject Classification ID

Duality theory for topological vector spaces (46A20) Multi-objective and goal programming (90C29)

Review text

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.

Recommendations

• Duality for multiobjective programming involving n-set functions
• scientific article; zbMATH DE number 1556641
• scientific article; zbMATH DE number 5063715
• A Fenchel-Rockafellar duality theorem for set-valued optimization
• scientific article; zbMATH DE number 5018678
• Lagrange multiplier theorem of multiobjective programming problems with set functions
• scientific article; zbMATH DE number 5018703
• Duality theorems for multiobjective fractional minimization problems involving set functions
• Lagrangian function and duality theory in multiobjective programming with set functions
• scientific article; zbMATH DE number 2159410

Cites work

• Application de la méthode des éléments finis à l'approximation d'un problème de domaine optimal. Méthodes de résolution des problèmes approches
• Convex programming with set functions
• Epigraphs of convex set functions
• Equazioni differenziali e algebriche: un algoritmo esplicito di tipo perturbativo
• scientific article; zbMATH DE number 3760758 (Why is no real title available?)
• scientific article; zbMATH DE number 3580375 (Why is no real title available?)
• scientific article; zbMATH DE number 938954 (Why is no real title available?)
• Lagrange multiplier theorem of multiobjective programming problems with set functions
• Optimal constrained selection of a measurable subset
• Saddle point and duality in the optimization theory of convex set functions

Cited in

(6)

• Lagrangian function and duality theory in multiobjective programming with set functions
• Lagrange multiplier theorem of multiobjective programming problems with set functions
• A Fenchel-Rockafellar duality theorem for set-valued optimization
• Fenchel duality for convex set functions
• A duality theory for set-valued functions. I: Fenchel conjugation theory
• On several results about convex set functions

This page was built for publication: Fenchel duality theorem in multiobjective programming problems with set functions

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