English

运筹学学报 >

2016 , Vol. 20 >Issue 2: 121 - 126

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

运筹学

向量优化中基于拟内部的弱C(\varepsilon)-有效解的标量化

展开
  • 1. 重庆师范大学数学科学学院, 重庆 401331

收稿日期: 2015-01-04

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

基金资助

国家自然科学基金(Nos. 11271391, 11301574), 第二批重庆市高等学校青年骨干教师资助计划, 重庆市研究生科研创新项目(Nos. CYS14136, CYS15154)

收起

Scalarization of weakly C(\varepsilon)-efficient solutions via quasi interior in vector optimization

Expand
  • 1. College of Mathematics Science, Chongqing Normal University, Chongqing 401331, China

Received date: 2015-01-04

  Online published: 2016-06-15

Fold

摘要

首先获得了co-radiant集的一些拟内部性质. 进而在邻近C(\varepsilon)-次似凸性假设条件下, 建立了相应的择一性定理, 并给出了基于拟内部的集值向量优化问题弱C(\varepsilon)-有效解的线性标量化结果.

关键词： 向量优化; 拟内部; co-radiant集; 弱C(\varepsilon)-有效解, 标量化

本文引用格式

张万里, 夏远梅, 赵克全 . 向量优化中基于拟内部的弱C(\varepsilon)-有效解的标量化[J]. 运筹学学报, 2016 , 20(2) : 121 -126 . DOI: 10.15960/j.cnki.issn.1007-6093.2016.02.012

Abstract

In this paper, some characterizations of co-radiant sets via quasi interior  are obtained. Furthermore, under the nearly C(\varepsilon)-subconvexlikeness, an alternative theorem is established and a linear scalarization result of weakly C(\varepsilon)-efficient solutions via quasi interior is given for a class of vector optimization problems with set-valued maps.

Key words： vector optimization; quasi interior; co-radiant sets; weakly C(\varepsilon)-efficient solutions; scalarization

参考文献

[1] Yang X M, Li D, Wang S Y. Near-subconvexlikeness in vector optimization with set-valued functions [J]. Journal of Optimization Theory and Applications, 2001, 110: 413-427.
[2] Zhao K Q, Yang X M. Characterizations of efficient and weakly efficient points in nonconvex vector optimization [J]. Journal of Global Optimization, 2014, Doi: 10.1007/s10898-014-0191-1.
[3] Rong  W D,  Wu Y N. \varepsilon-weak minimal solutions of vector optimization problems with set-valued maps [J]. Journal of Optimization Theory and Applications, 2000, 106: 569-579.
[4] Guti\'{e}rrez C, Jimnez B, Novo V. A unified approach and optimality conditions for approximate solutions of vector optimization problems [J]. SIAM Journal on Optimization, 2006, 17: 688-710.
[5] Limber M A,  Goodrich R K. Quasi interiors, lagrange multipliers, and L^p spectral estimation with lattice bounds [J]. Journal of Optimization Theory and Applications, 1993, 78: 143-161.
[6] Borwein J M, Lewis A S. Partially finite convex programming, Part I: quasi relative interiors and duality theory [J].  Mathematical Programming, 1992,  57: 15-48.
[7] Bo\c{t} R I,  Csetnek E R,  Wanka G.  Regularity conditions via quasi-relative interior in convex programming [J]. SIAM Journal on Optimization, 2008, 19: 217-233.
[8] Bao T Q, Mordukhovich B S. Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions [J]. Mathematical Programming, 2010,  122: 301-347.
[9] Zhou Z A,  Yang X M. Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior [J]. Journal of Optimization Theory and Applications, 2011, 150: 327-340.
[10] 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.
Options
文章导航

/

〈 〉