English

运筹学学报 >

2015 , Vol. 19 >Issue 2: 105 - 110

DOI: https://doi.org/10.15960/j.cnki.issn.1007-6093.2015.02.012

运筹学

向量优化问题 (C,\varepsilon)-弱有效解的一种非线性标量化性质

展开
  • 1. 上海大学理学院, 上海  200444; 2. 重庆师范大学数学学院, 重庆  400047

收稿日期: 2014-04-18

  网络出版日期: 2015-06-15

基金资助

1. 国家自然科学基金(Nos. 11301574, 11271391);
2. 重庆市重点科技项目(No. 2011BA0030)

收起

A characterization of weakly (C,\varepsilon)-efficient solution of vector optimization via nonlinear scalarization

Expand
  • 1. College of Sciences, Shanghai University, Shanghai 200444, China; 2. College of Mathematical Sciences, Chongqing Normal University, Chongqing 400047, China

Received date: 2014-04-18

  Online published: 2015-06-15

Fold

摘要

Guti\'{e}rrez 等在 co-radiant 集的基础上提出了一种新的 (C,\varepsilon)-弱有效解, 它统一了之前文献中提出的几种经典的近似解. 利用由 G\"{o}pfert 等提出的一类非线性标量化函数, 给出了 (C,\varepsilon)-弱有效解的一个等价性质. 最后, 给出一个例子说明主要结果.

关键词： (C,\varepsilon)-弱有效解; 非线性标量化; 向量优化

本文引用格式

郭辉 . 向量优化问题 (C,\varepsilon)-弱有效解的一种非线性标量化性质[J]. 运筹学学报, 2015 , 19(2) : 105 -110 . DOI: 10.15960/j.cnki.issn.1007-6093.2015.02.012

Abstract

Recently, Guti\'{e}rrez et al. proposed a new type of efficiency based on co-radiant set which called (C,\varepsilon)-efficient solution in vector optimization. This new notion of efficiency unifies some well-known concepts introduced previously in the literature. In this paper, we characterizes the new (C,\varepsilon)-efficient solution by a nonlinear scalarization function proposed by G\"{o}pfert, et al. Furthermore, an example is given to illustrate our main result.

Key words： weakly (C,\varepsilon)-efficient solution; nonlinear scalarization; vector optimization

参考文献

Kutateladze S S. Convex  \varepsilon-programming [J]. Soviet Mathematics Doklady, 1979, 20(2): 390-393.
White D J. Epsilon efficiency [J]. Journal of Optimization Theory and Applications, 1986, 49(2): 319-337.
Helbig S. On a new concept for \varepsilon-efficiency [R]. \" Montreal: Centre for Research on Transportation, 1992.
N\'{e}meth A B. A nonconvex vector minimization problem [J]. Nonlinear Analysis, 1986, 10(7): 669-678.
Tanaka T. A new approach to approximately of solutions in vector optimization problems [C]//Proceedings of APORS, Singapore: World
Scientific Publishing, 1995, 497-504.
Guti\'{e}rrez C, Jim\'{e}nez B, Novo V. An unified approach and optimality conditions for approximate solutions of vector optimization problems
[J]. SIAM Journal on Optimization, 2006, 17(3): 688-710.
Guti\'{e}rrez C, Jim\'{e}nez B, Novo V. On approximate efficiency in multiobjective programming [J]. Mathematical Methods of Operational Research, 2006, 64(1): 165-185.
Guti\'{e}rrez C, Huerga L, Novo V. Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems [J]. Journal of Mathematical Analysis and Applications, 2012, 389: 1046-1058.
Gao Y, Yang X M, Teo K L. Optimality conditions for approximate solutions of vector optimization problems [J]. Journal of Industrial and Management Optimization, 2011, 7(2): 483-496.
Zaffaroni A. Degrees of efficiency and degrees of minimality [J]. SIAM Journal on Control and Optimization, 2003, 42(3): 1071-1086.
G\"{o}pfert A, Tammer C, Riahi H, et al. Variational Methods in Partially Ordered Spaces [M]. New York: Springer-verlag, 2003.
Tammer C, Z\u{a}linescu C. Lipschitz properties of the scalarization function and applications [J]. Optimization, 2010, 59(2): 305-319.
Hiriart-Urruty J B. Tangent cones, generalized gradients and mathematical programming in Banach spaces [J]. Mathematics of Operations Research, 1979, 4(1): 49-97.
Options
文章导航

/

〈 〉