Optimality and duality in nonsmooth multiobjective optimization involving V-type i invex functions

Ravi P. Agarwal, I. Ahmad, Z. Husain, A. Jayswal

Research output: Contribution to journalArticlepeer-review

12 Scopus citations

Abstract

A new class of generalized V-type I invex functions is introduced for nonsmooth multiobjective programming problem. Based upon these generalized invex functions, we establish sufficient optimality conditions for a feasible point to be an efficient or a weakly efficient solution. Weak, strong, and strict converse duality theorems are proved for Mond-Weir type dual program in order to relate the weakly efficient solutions of primal and dual programs.

Original languageEnglish
Article number898626
JournalJournal of Inequalities and Applications
Volume2010
DOIs
StatePublished - 2010

ASJC Scopus subject areas

  • Analysis
  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Optimality and duality in nonsmooth multiobjective optimization involving V-type i invex functions'. Together they form a unique fingerprint.

Cite this