2016
DOI: 10.1080/02331934.2016.1152473
|View full text |Cite
|
Sign up to set email alerts
|

Coderivative necessary optimality conditions for sharp and robust efficiencies in vector optimization with variable ordering structure

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

1
5
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 7 publications
(6 citation statements)
references
References 19 publications
1
5
0
Order By: Relevance
“…This newly introduced concept clearly covers the case of Henig proper efficiency described before provided that the base of K(x) with x close to x is a.c., and, moreover, this is in the same line with other notions of efficiency developed in [6] and [10]. We give a short account on these concepts, since we investigate in the sequel some interesting links between all these efficiencies.…”
supporting
confidence: 63%
See 4 more Smart Citations
“…This newly introduced concept clearly covers the case of Henig proper efficiency described before provided that the base of K(x) with x close to x is a.c., and, moreover, this is in the same line with other notions of efficiency developed in [6] and [10]. We give a short account on these concepts, since we investigate in the sequel some interesting links between all these efficiencies.…”
supporting
confidence: 63%
“…Remark that the previous theorem can be formulated for (x, z) ∈ Gr G and (x, w) ∈ Gr K instead of (x, 0) ∈ Gr G ∩ Gr K, but we prefer the present form because of the later use in the paper. Observe that if in Theorem 4.7 we take K (x) := 0 for every x ∈ X, then we obtain Theorem 4.2 from [14], which is an openness result for F + G. Furthermore, in case G (x) := 0 for every x ∈ X, then we obtain Theorem 5.2 from [10].…”
Section: 2mentioning
confidence: 76%
See 3 more Smart Citations