Efficient and weak efficient points in vector optimization with generalized cone convexity

DOI10.1016/S0893-9659(03)80035-6zbMath1055.90062OpenAlexW1970499169MaRDI QIDQ1433643

Vicente Novo Sanjurjo, Miguel Adán

Publication date: 1 July 2004

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0893-9659(03)80035-6

zbMATH Keywords

EfficiencyVector optimizationGeneralized cone-convexitySubconvexity

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming in abstract spaces (90C48)

Related Items (8)

Duality and saddle-points for convex-like vector optimization problems on real linear spaces ⋮ Vector optimization w.r.t. relatively solid convex cones in real linear spaces ⋮ Algebraic interior and separation on linear vector spaces: some comments ⋮ Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness. ⋮ Some characterizations of ideal points in vector optimization problems ⋮ Optimality conditions of set-valued optimization problem involving relative algebraic interior in ordered linear spaces ⋮ A generalized alternative theorem of partial and generalized cone subconvexlike set-valued maps and its applications in linear spaces ⋮ On the Intrinsic Core of Convex Cones in Real Linear Spaces

Cites Work

• A generalization of a minimax theorem of Fan via a theorem of the alternative
• Alternative theorems and optimality conditions with weakened convexity
• Lagrange multipliers and saddle points in multiobjective programming
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• Minimax Theorems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient and weak efficient points in vector optimization with generalized cone convexity