Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential (Q2351521): Difference between revisions
From MaRDI portal
Latest revision as of 08:03, 10 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential |
scientific article |
Statements
Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential (English)
0 references
24 June 2015
0 references
The authors derive a necessary and sufficient condition for weak efficiency and a sufficient criteria for efficiency of nonconvex nonsmooth vector optimization problems involving inequality constraints and a closed convex set constraint with C(T)-valued mappings in terms of the Clarke subdifferentials under suitable generalized convexity together with some special cases.
0 references
optimality conditions
0 references
nonconvex vector optimization
0 references
efficient point
0 references
weakly efficient point
0 references
linearizing cone
0 references
0 references
0 references
0 references
0 references
