当前位置: X-MOL 学术Optimization › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On the optimality conditions for D.C. vector optimization problems
Optimization ( IF 2.2 ) Pub Date : 2020-12-02 , DOI: 10.1080/02331934.2020.1847109
Bahareh Khazayel 1 , Ali Farajzadeh 1
Affiliation  

In this paper, by using the notions of approximate pseudo-dissipativity, strong subdifferential and epsilon-subdifferential, we present sufficient optimality conditions for an epsilon-weak local Pareto minimal solution and an epsilon-local Pareto minimal solution of a vector optimization problem, where its objective function and constraint set are in the form of differences of two vector-valued convex maps, respectively. Then, an application of the given result is obtained for vector fractional programming. Also, some comments are given on two recently published papers presented by Guo and Li [Optimality conditions for vector optimization problems with difference of convex maps. J Optim Theory Appl. 2014;162:821–844] and Gadhi and Metrane [Sufficient optimality condition for vector optimization problems under D.C. J Glob Optim. 2004;28:55–66].



中文翻译:

DC向量优化问题的最优性条件

在本文中,通过使用近似伪耗散性、强次微分和 epsilon-次微分的概念,我们为向量优化问题的 epsilon-弱局部 Pareto 最小解和 epsilon-local Pareto 最小解提出了充分的最优性条件,其中它的目标函数和约束集分别是两个向量值凸图的差分形式。然后,将给定的结果应用到向量分数规划中。此外,还对郭和李最近发表的两篇论文[Optimality conditions for vector optimization questions with different of convex map]给出了一些评论。J Optim 理论应用程序。2014;162:821–844] 和 Gadhi 和 Metrane [DC J Glob Optim 下向量优化问题的充分最优条件。2004;28:55-66]。

更新日期:2020-12-02
down
wechat
bug