中文

Operations Research Transactions >

2023 , Vol. 27 >Issue 3: 121 - 128

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

Stability of solutions for a class of non-convex vector optimization problems with mapping differences

Expand
  • 1. School of Mathematics and Statistics, Chongqing Technology and Business University, Chongqing 400067, China

Received date: 2022-01-28

  Online published: 2023-09-14

Fold

Abstract

The data of problem are often perturbed in real life. We often calculate the solution of a perturbed problem to approximate the original problem solution. Therefore, the stability of the solution set of the original problem is an important issue. In this paper, we consider a class of non-convex vector optimization problems with two mapping differences. By taking advantage of appropriate convergence and convexity of the two mappings, the stability results of the nonconvex vector optimization problem is obtained, when the approximate problem data converge to the original problem data in the sense of Painlevé-Kuratowski's convergence.

Key words： non-convex optimization; Painlevé-Kuratowski convergence; stability; properly quasi $C$-concave; $C$-convex

Cite this article

Jing ZENG, Ruowen DING . Stability of solutions for a class of non-convex vector optimization problems with mapping differences[J]. Operations Research Transactions, 2023 , 27(3) : 121 -128 . DOI: 10.15960/j.cnki.issn.1007-6093.2023.03.009

References

1 GuoX L,ZhaoC J,LiZ W.On generalized $\varepsilon$-subdifferential and radial epiderivative of set-valued mappings[J].Optimization Letters,2014,8(5):1707-1720.
2 GuoX L,LiS J.Optimality conditions for vector optimization problems with difference of convex maps[J].Journal of Optimization Theory and Applications,2014,162(3):821-844.
3 SunX K,ChaiY.Optimality conditions for DC fractional programming problems[J].Advances in Mathematics,2014,43(6):895-904.
4 Le ThiH A,Pham DinhT.DC programming and DCA: Thirty years of developments[J].Mathematical Programming,2018,169(1):5-68.
5 HorstR,ThoaiN V.DC programming: Overview[J].Journal of Optimization Theory and Applications,1999,103(1):1-43.
6 TuyH.Handbook of Global Optimization[M].Boston:Springer,1995:149-216.
7 ChenG Y,HuangX X.Stability results for Ekland's $\varepsilon$-variational principle for vector-valued functions[J].Mathematical Methods of Operations Research,1998,48(1):97-103.
8 HuangX X.Stability in vector-valued and set-valued optimization[J].Mathematical Methods of Operations Research,2000,52(2):185-193.
9 LucchettiR E,MiglierinaE.Stability for convex vector optimization problems[J].Optimization,2004,53(5/6):517-528.
10 ZengJ,LiS J,ZhangW Y,et al.Stability results for convex vector-valued optimization problems[J].Positivity,2011,15(3):441-453.
11 LiX B,WangQ L,LinZ.Stability results for properly quasiconvex vector optimization problems[J].Optimization,2013,64(5):1329-1347.
12 RockafellarR T,WetsR J B.Variational Analysis[M].Berlin Heidelberg:Springer-Verlag,1998:108-144.
13 LiX B,LinZ,PengZ Y.Convergence for vector optimization problems with variable ordering structure[J].Optimization,2016,65(8):1615-1627.
14 TanakaT.Generalized quasiconvexities, cone saddle points, and minimax theorem for vector-valued functions[J].Journal of Optimization Theory and Applications,1994,81(2):355-377.
15 Ferro,F.Minimax type theorems for $n$-valued functions[J].Annali di Matematica pura ed applicata,1982,132(1):113-130.
16 AuslenderA,TeboulleM.Asymptotic Cones and Functions in Optimization and Variational Inequalities[M].New York:Springer-Verlag,2003:26-31.
17 LucD T.Theory of Vector Optimization[M].Berlin Heidelberg:Spriger-Verlag,1998:62-77.
Options
Outlines

/

〈 〉