Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized (F,α,ρ,θ)-d-V-univex functions

Anurag Jayswal*, I. Ahmad, S. Al-Homidan

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

In this paper, we introduce a new class of generalized (F,α,ρ,θ)-d-V-univex functions for a nonsmooth multiobjective programming problem. Sufficient optimality conditions under generalized (F,α,ρ,θ)-d-V-univex functions are established for a feasible solution to be an efficient solution. Appropriate duality theorems for a Mond-Weir-type dual are also presented under the aforesaid assumptions.

Original languageEnglish
Pages (from-to)81-90
Number of pages10
JournalMathematical and Computer Modelling
Volume53
Issue number1-2
DOIs
StatePublished - Jan 2011

Keywords

  • Duality
  • Efficiency
  • Generalized (F,α,ρ,θ)-d-V-univex functions
  • Multiobjective programming
  • Sufficient optimality conditions

ASJC Scopus subject areas

  • Modeling and Simulation
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized (F,α,ρ,θ)-d-V-univex functions'. Together they form a unique fingerprint.

Cite this