Volume 51, Number 2, April-June 2017
|Page(s)||433 - 446|
|Published online||30 March 2017|
Optimality and duality in multiobjective programming involving support functions∗
Received: 1 December 2015
Accepted: 20 May 2016
In this paper a vector optimization problem (VOP) is considered where each component of objective and constraint function involves a term containing support function of a compact convex set. Weak and strong Kuhn−Tucker necessary optimality conditions for the problem are obtained under suitable constraint qualifications. Necessary and sufficient conditions are proved for a critical point to be a weak efficient or an efficient solution of the problem (VOP) assuming that the functions belong to different classes of pseudoinvex functions. Two Mond Weir type dual problems are considered for (VOP) and duality results are established.
Mathematics Subject Classification: 90C26 / 90C29 / 90C46
Key words: Generalized invexity / multiobjective programming support functions / optimality conditions / Duality
© EDP Sciences, ROADEF, SMAI 2017
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.