Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
type: Item
instance of: scholarly article
title: Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
zbMATH Open document ID: 1033.90113
DOI: 10.1016/S0377-2217(02)00444-7
published in: European Journal of Operational Research
publication date: 2003-07-30T00:00:00Z
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 1957064
zbMATH Keywords: Generalized convexlikeness
zbMATH Keywords: vector-convexlikeness
zbMATH Keywords: Vector optimization
zbMATH Keywords: weak efficiency
author: Miguel Adán
author: V. Novo
MaRDI profile type: Publication
cites work: Q4547597
cites work: Q4535735
cites work: Efficient and weak efficient points in vector optimization with generalized cone convexity
cites work: Q3700270
cites work: Foundations of optimization
cites work: Q4296819
cites work: Q4347619
cites work: On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
cites work: Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
cites work: Q3701188
cites work: Convexlike alternative theorems and mathematical programming
cites work: Inequality systems and optimization
cites work: Lagrange multipliers and saddle points in multiobjective programming
cites work: Convexlike and concavelike conditions in alternative, minimax, and minimization theorems
cites work: Alternative theorems and optimality conditions with weakened convexity
cites work: A generalization of a theorem of Fan
cites work: Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
description: scientific article; zbMATH DE number 1957064