Generalized Convexity in Multiobjective Programming
Copyright policy )Generalized Convexity in Multiobjective Programming
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.
- University of Seville Spain
generalized convexity, vector optimization, Applied Mathematics, KT-invexity, weakly efficient points, Optimality conditions and duality in mathematical programming, Multi-objective and goal programming, Analysis
generalized convexity, vector optimization, Applied Mathematics, KT-invexity, weakly efficient points, Optimality conditions and duality in mathematical programming, Multi-objective and goal programming, Analysis
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).46 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!