Duality for multiobjective optimization problems with convex objective functions and D.C. constraints

DOI10.1016/j.jmaa.2005.06.067zbMath1156.90015OpenAlexW2087510134MaRDI QIDQ819667

Radu Ioan Boţ, Gert Wanka

Publication date: 29 March 2006

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2005.06.067

zbMATH Keywords

optimality conditionsmultiobjective optimizationconjugate dualityD.C. constraints

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Related Items (17)

Farkas-type results for fractional programming problems ⋮ Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces ⋮ Duality and optimality conditions for reverse convex programs via a convex decomposition ⋮ Necessary optimality conditions for vector reverse convex minimization problems via a conjugate duality ⋮ Stable zero Lagrange duality for DC conic programming ⋮ On economic equilibrium type problems with applications ⋮ An extended conjugate duality for generalized semi-infinite programming problems via a convex decomposition ⋮ Some new Farkas-type results for inequality systems with DC functions ⋮ A general approach for studying duality in multiobjective optimization ⋮ On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint ⋮ A duality approach for a class of semivectorial bilevel programming problems ⋮ Multiobjective DC programs with infinite convex constraints ⋮ Pareto optimality and Walrasian equilibria ⋮ Duality and Farkas-type results for DC fractional programming with DC constraints ⋮ Some Farkas-type results for fractional programming problems with DC functions ⋮ Optimality conditions and duality for DC programming in locally convex spaces ⋮ An Extended Fenchel--Lagrange Duality Approach and Optimality Conditions for Strong Bilevel Programming Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Duality principles for optimization problems dealing with the difference of vector-valued convex mappings
• Concave duality: Application to problems dealing with difference of functions
• A general duality scheme for nonconvex minimization problems with a strict inequality constraint
• Duality in D. C. programming: The case of several D. C. constraints
• Multiobjective duality for convex-linear problems. II
• Multiobjective control approximation problems: duality and optimality.
• New constraint qualification and conjugate duality for composed convex optimization problems
• Proper efficiency and the theory of vector maximization
• Inf-convolution, sous-additivite, convexite des fonctions numériques
• Duality in Reverse Convex Optimization

This page was built for publication: Duality for multiobjective optimization problems with convex objective functions and D.C. constraints