Duality for multiobjective optimization problems with convex objective functions and D.C. constraints
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- scientific article; zbMATH DE number 1328991 (Why is no real title available?)
- scientific article; zbMATH DE number 1792004 (Why is no real title available?)
- A general duality scheme for nonconvex minimization problems with a strict inequality constraint
- Concave duality: Application to problems dealing with difference of functions
- Duality in D. C. programming: The case of several D. C. constraints
- Duality in Reverse Convex Optimization
- Duality principles for optimization problems dealing with the difference of vector-valued convex mappings
- Inf-convolution, sous-additivite, convexite des fonctions numériques
- Multiobjective control approximation problems: duality and optimality.
- Multiobjective duality for convex-linear problems. II
- New constraint qualification and conjugate duality for composed convex optimization problems
- Proper efficiency and the theory of vector maximization
Cited in
(26)- A duality approach for a class of semivectorial bilevel programming problems
- Farkas-type results for fractional programming problems
- On economic equilibrium type problems with applications
- Conjugate duality for multiobjective composed optimization 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
- scientific article; zbMATH DE number 1322882 (Why is no real title available?)
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint
- An extended Fenchel-Lagrange duality approach and optimality conditions for strong bilevel programming problems
- Some new Farkas-type results for inequality systems with DC functions
- A general approach for studying duality in multiobjective optimization
- Pareto optimality and Walrasian equilibria
- Necessary optimality conditions for vector reverse convex minimization problems via a conjugate duality
- Duality for generalized convex multiobjective programming without a constraint qualification
- scientific article; zbMATH DE number 2159410 (Why is no real title available?)
- scientific article; zbMATH DE number 1792004 (Why is no real title available?)
- scientific article; zbMATH DE number 2100861 (Why is no real title available?)
- Multiobjective DC programs with infinite convex constraints
- Duality for a kind of multiobjective optimization problem under generalized convexity
- Some Farkas-type results for fractional programming problems with DC functions
- An extended conjugate duality for generalized semi-infinite programming problems via a convex decomposition
- Stable zero Lagrange duality for DC conic programming
- Optimality conditions and duality for DC programming in locally convex spaces
- Duality for multiobjective semidefinite optimization problems
- scientific article; zbMATH DE number 1594507 (Why is no real title available?)
- Duality and Farkas-type results for DC fractional programming with DC constraints
This page was built for publication: Duality for multiobjective optimization problems with convex objective functions and D.C. constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q819667)
