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

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

Miguel Adán, Vicente Novo Sanjurjo

Publication date: 1 July 2004

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

zbMATH Keywords

Efficiency; Vector optimization; Generalized cone-convexity; Subconvexity

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

90C48: Programming in abstract spaces

Related Items

Optimality conditions of set-valued optimization problem involving relative algebraic interior in ordered linear spaces, Algebraic interior and separation on linear vector spaces: some comments, Duality and saddle-points for convex-like vector optimization problems on real linear spaces, Some characterizations of ideal points in vector optimization problems, Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness., A generalized alternative theorem of partial and generalized cone subconvexlike set-valued maps and its applications in 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