Open AccessGlobal Connecting Dual Representation of Non-Smooth Multi-Objective Programs using Convex Functions
Author(s) -
P. Jeyalakshmi
Publication year - 2019
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.a1200.1291s419
Subject(s) - mathematics , convex analysis , duality (order theory) , regular polygon , dual (grammatical number) , convex function , representation (politics) , proper convex function , dual representation , subderivative , dual pair , convex set , convex optimization , pure mathematics , functional analysis , geometry , art , biochemistry , chemistry , topological tensor product , literature , politics , political science , law , gene
New classes of vector functions ,namely V-( , , )- pseudo convex and V- ( , , )- quasi convex functions are introduced which are weaker than V-( , , )- convex functions. Sufficient optimality conditions for proper potency and numerous duality theorems for a category of nonsmooth multiobjective programs are obtained under the assumptions of the above said functions.