中文

Operations Research Transactions >

2021 , Vol. 25 >Issue 2: 135 - 143

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

The equivalent representation of co-radiant sets and its application in multi-objective optimization problems

Expand
  • 1. School of Mathematical Sciences, Chongqing Normal University, Chongqing 401331, China

Received date: 2020-07-03

  Online published: 2021-05-06

Fold

Abstract

As a special abstract convex (concave) sets, radiant sets and co-radiant sets play the important roles in abstract convex analysis and the theory of multiobjective optimization problems. We first establish the equivalent characterizations for the radiant sets and co-radiant sets. Finally, we apply important properties to the characterization of the approximate solutions of the vector optimization problems, and obtain the equivalent characterization of the approximate solution sets.

Key words： co-radiant sets; radiant sets; equivalent representations; vector optimization problems; approximate solutions

Cite this article

Wenyi WANG, Ying GAO, Fuping LIU . The equivalent representation of co-radiant sets and its application in multi-objective optimization problems[J]. Operations Research Transactions, 2021 , 25(2) : 135 -143 . DOI: 10.15960/j.cnki.issn.1007-6093.2021.02.011

References

1 Rubinov A M . Abstract Convexity and Global Optimization[M]. Boston: Kluwer Academic Publishers, 2000.
2 Rockafellar R T . Convex Analysis[M]. Princeton: Princeton University Press, 1970.
3 Pallaschke D , Rolewicz S . Foundations of Mathematical Optimization: Convex Analysis without Linearity[M]. Dordrecht: Springer, 1997.
4 Singer I . Abstract Convex Analysis[M]. New York: Wiley, 1997.
5 Penot J P . Radiant and co-radiant dualities[J]. Pacific Journal of Optimization, 2010, 6 (2): 263- 279.
6 Zaffaroni A . Superlinear separation for radiant and co-radiant sets[J]. Optimization, 2007, 56 (1/2): 267- 285.
7 Sheykhi A , Doagooei A R . Radiant separation theorems and minimum-type subdifferentials of calm functions[J]. Journal of Optimization Theory and Applications, 2017, 174 (3): 693- 711.
8 Jord á n, Abelardo, Mart í nez-Legaz, et al. Co-radiant set-valued mappings[J]. 2019, arXiv: 1902.10772.
9 Gutiérrez C , Jiménez B , Novo V . On approximate efficiency in multiobjective programming[J]. Mathematical Methods of Operations Research, 2006, 64, 165- 185.
10 Gutiérrez C , Jiménez B , Novo V . A unified approach and optimality conditions for approximate solutions of vector optimization problems[J]. SIAM Journal on Optimization, 2006, 17 (3): 688- 710.
11 Sayadi-bander A , Kasimbeyli R , Pourkarimi L . A co-radiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures[J]. Operations Research Letters, 2016,
12 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, 11 (3): 495- 510.
13 Gao Y , Hou S H , Yang X M . Existence and optimality conditions for approximate solutions to vector optimization problems[J]. Journal of Industrial and Management Optimization, 2012, 152 (1): 97- 120.
14 Sayadi-Bander A , Pourkarimi L , Kasimbeyli R , et al. Coradiant sets and $ \varepsilon $-efficiency in multiobjective optimization[J]. Journal of Global Optimization, 2017, 68 (3): 587- 600.
15 Engau A. Adomination and decomposition in multiobjective programming[D]. Clemson: Clemson University, 2007.
16 高英. 多面体集下多目标优化问题近似解的若干性质[J]. 运筹学学报, 2013, 17 (2): 48- 52.
Options
Outlines

/

〈 〉