Generalized convexity in multiobjective programming (Q5906377)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1289956
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalized convexity in multiobjective programming |
scientific article; zbMATH DE number 1289956 |
Statements
Generalized convexity in multiobjective programming (English)
0 references
9 January 2000
0 references
Consider a multicriteria or vector optimization problem of the form: ``Minimize \(f(x)= (f_1(x),\dots\), \(f_n(x))\) subject to \(x\in S\) and \(g(x)\leq 0\).'' The authors discuss the role played by the concepts of KT-invexity and KT-pseudoinvexity in connection with the establishment of Kuhn-Tucker optimality conditions for weakly efficient points.
0 references
generalized convexity
0 references
vector optimization
0 references
KT-invexity
0 references
weakly efficient points
0 references
0 references
0 references
0.8755432367324829
0 references
0.8739894032478333
0 references
0.8690151572227478
0 references
0.8612803220748901
0 references
