Skip to main content

Optimality and Duality in Nonsmooth Multiobjective Optimization Involving V-Type I Invex Functions

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.

Publisher note

To access the full article, please see PDF.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to RaviP Agarwal.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and Permissions

About this article

Cite this article

Agarwal, R., Ahmad, I., Husain, Z. et al. Optimality and Duality in Nonsmooth Multiobjective Optimization Involving V-Type I Invex Functions. J Inequal Appl 2010, 898626 (2010). https://doi.org/10.1155/2010/898626

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1155/2010/898626

Keywords

  • Programming Problem
  • Multiobjective Optimization
  • Efficient Solution
  • Feasible Point
  • Duality Theorem