Global Connecting Dual Representation of Non-Smooth Multi-Objective Programs using Convex Functions
Jeya Lakshmi P.
P. Jeya Lakshmi, Department of Mathematics, Kalasalingam Academy of Research and Education College, Krishnankovil (Tamil Nadu), India.
Manuscript received on 25 November 2019 | Revised Manuscript received on 19 December 2019 | Manuscript Published on 30 December 2019 | PP: 952-956 | Volume-9 Issue-1S4 December 2019 | Retrieval Number: A12001291S419/19©BEIESP | DOI: 10.35940/ijeat.A1200.1291S419
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: 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.
Keywords: Duality, Nonsmooth Multiobjective Programs, Optimality, V-( , , )- Pseudo Convex and V-( , , )-Quasiconvex.
Scope of the Article: Software Defined Networking and Network Function Virtualization