The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2018
DOI: 10.1186/s13660-018-1891-8
|View full text |Cite
|
Sign up to set email alerts
|

Globally proper efficiency of set-valued optimization and vector variational inequality involving the generalized contingent epiderivative

Abstract: In this paper, firstly, a new property of the cone subpreinvex set-valued map involving the generalized contingent epiderivative is obtained. As an application of this property, a sufficient optimality condition for constrained set-valued optimization problem in the sense of globally proper efficiency is derived. Finally, we establish the relations between the globally proper efficiency of the set-valued optimization problem and the globally proper efficiency of the vector variational inequality.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 32 publications
0
2
0
Order By: Relevance
“…Such properties are crucial to derive necessary optimality conditions for problem (2.2). See [56] for globally proper efficiency results and optimality conditions for generalized vector variational inequalities involving the generalized contingent epiderivative. Besides stability and sensitivity analysis, the well-posedness of problem (2.2) and related problems has been investigated in [83,143].…”
Section: Stability and Sensitivity Analysismentioning
confidence: 99%
“…Such properties are crucial to derive necessary optimality conditions for problem (2.2). See [56] for globally proper efficiency results and optimality conditions for generalized vector variational inequalities involving the generalized contingent epiderivative. Besides stability and sensitivity analysis, the well-posedness of problem (2.2) and related problems has been investigated in [83,143].…”
Section: Stability and Sensitivity Analysismentioning
confidence: 99%
“…As we all know, convexity and generalized convexity play a crucial role in many aspects of mathematical programming including, for example, optimality conditions, duality theorems, saddle points, variational inequalities and characterizations of the solution sets, one can refer to [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18]. In terms of some properties and characterizations of the solution sets, they are very useful for understanding the behavior of solution methods for optimization problems that have multiple optimal solutions.…”
Section: Introductionmentioning
confidence: 99%