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

DOI10.1007/BF02579060zbMath1112.90074MaRDI QIDQ819956

Miguel Adán, Vicente Novo Sanjurjo

Publication date: 4 April 2006

Published in: Top (Search for Journal in Brave)

zbMATH Keywords

dualitysaddle-pointsweak efficiencyproper efficiencyVector optimizationvector convexlikeness

Mathematics Subject Classification ID

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

Related Items

Characterizations of Benson proper efficiency of set-valued optimization in real linear spaces ⋮ Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems ⋮ Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints ⋮ Nonconvex Separation Functional in Linear Spaces with Applications to Vector Equilibria

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proper efficiency in vector optimization on real linear spaces.
• Efficiency and proper efficiency in vector maximization with respect to cones
• Alternative theorems and optimality conditions with weakened convexity
• Characterizations of the Benson proper efficiency for nonconvex vector optimization
• Proper solutions of vector optimization problems
• Generalized quasiconvexities, cone saddle points, and minimax theorem for vector-valued functions
• Lagrange multipliers and saddle points in multiobjective programming
• Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
• Efficient and weak efficient points in vector optimization with generalized cone convexity
• A characterization of generalized saddle points for vector-valued functions via scalarization
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• Convexlike alternative theorems and mathematical programming
• Scalarization and lagrange duality in multiobjective optimization
• Duality in nondifferentiable vector programming