Existence and characterization theorems in nonconvex vector optimization

被引：0
作者：
Nergiz Kasimbeyli
机构：
[1] Anadolu University,Department of Industrial Engineering, Faculty of Engineering
来源：
Journal of Global Optimization | 2015年 / 62卷
关键词：
Vector optimization; Nonlinear separation theorem; Augmented dual cone; Sublinear scalarizing functions; Conic scalarization method; Proper efficiency; Existence theorem;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
This paper presents existence conditions and characterization theorems for minimal points of nonconvex vector optimization problems in reflexive Banach spaces. Characterization theorems use special class of monotonically increasing sublinear scalarizing functions which are defined by means of elements of augmented dual cones. It is shown that the Hartley cone-compactness is necessary and sufficient to guarantee the existence of a properly minimal point of the problem. The necessity is proven in the case of finite dimensional space.
引用
收藏
页码：155 / 165
页数：10
相关论文
共 53 条
[1]  
Borwein JM(1983)On the existence of Pareto efficient points Math. Oper. Res. 8 64-73
[2]  
Bronsted A(1974)On a lemma of Bishop and Phelps Pac. J. Math. 55 335-341
[3]  
Cesari L(1976)Existence theorems for Pareto optimization in Banach spaces Bull. Am. Math. Soc. 82 306-308
[4]  
Suryanarayana MB(1990)Positive proper efficient points and related cone results in vector optimization theory SIAM J. Control Optim. 28 158-172
[5]  
Dauer JP(1993)A characterization of proper minimal points as solutions of sublinear optimization problems J. Math. Anal. Appl. 178 227-246
[6]  
Gallagher RJ(2009)Multiobjective programming and multiattribute utility functions in portfolio optimization INFOR Inf. Syst. Oper. Res. 47 31-42
[7]  
Dauer JP(2011)Optimality conditions for a unified vector optimization problem with not necessarily preordering relations Optimization 60 1399-1419
[8]  
Saleh OA(2013)A unified vector optimization problem: complete scalarizations and applications J. Glob. Optim. 56 299-315
[9]  
Ehrgott M(2002)Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming J. Glob. Optim. 24 187-203
[10]  
Waters C(2006)Separation via polyhedral conic functions Optim. Methods Softw. 21 527-540
123456