Duality and saddle-points for convex-like vector optimization problems on real linear spaces

DOI10.1007/BF02579060MaRDI QIDQ819956zbMATH OpenFDO

Authors Miguel Adán, V. Novo

Publication date 4 April 2006

Published in Top (Search for Journal in Brave)

zbMATH Keywords

dualityweak efficiencyproper efficiencyVector optimizationsaddle-pointsvector convexlikeness

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1786289
• scientific article; zbMATH DE number 2156773
• The generalized vector convex-like mappings on real linear spaces
• Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
• Proper efficiency in vector optimization on real linear spaces.

Cites work

• scientific article; zbMATH DE number 3926624 (Why is no real title available?)
• scientific article; zbMATH DE number 592622 (Why is no real title available?)
• scientific article; zbMATH DE number 1159281 (Why is no real title available?)
• scientific article; zbMATH DE number 2063780 (Why is no real title available?)
• scientific article; zbMATH DE number 1755834 (Why is no real title available?)
• A characterization of generalized saddle points for vector-valued functions via scalarization
• Alternative theorems and optimality conditions with weakened convexity
• Characterizations of the Benson proper efficiency for nonconvex vector optimization
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• Convexlike alternative theorems and mathematical programming
• Duality in nondifferentiable vector programming
• Efficiency and proper efficiency in vector maximization with respect to cones
• Efficient and weak efficient points in vector optimization with generalized cone convexity
• Generalized quasiconvexities, cone saddle points, and minimax theorem for vector-valued functions
• Lagrange multipliers and saddle points in multiobjective programming
• Proper efficiency in vector optimization on real linear spaces.
• Proper solutions of vector optimization problems
• Scalarization and lagrange duality in multiobjective optimization
• Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.

Cited in

(10)

• scientific article; zbMATH DE number 7071078 (Why is no real title available?)
• Duality assertions in vector optimization w.r.t. relatively solid convex cones in real linear spaces
• Saddle points and gap functions for vector equilibrium problems via conjugate duality in vector optimization
• Characterizations of Benson proper efficiency of set-valued optimization in real linear spaces
• Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints
• Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
• Nonconvex Separation Functional in Linear Spaces with Applications to Vector Equilibria
• Algebraic representation of dual scalar products and stabilization of saddle point problems
• The generalized vector convex-like mappings on real linear spaces
• Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems

This page was built for publication: Duality and saddle-points for convex-like vector optimization problems on real linear spaces

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