Sufficiency and duality in nondifferentiable multiobjective programming involving higher order strong invexity

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

In the present paper, we consider a nondifferentiable multiobjective programming problem with support functions and locally Lipschitz functions. Several sufficient optimality conditions are discussed for a strict minimizer of a nondifferentiable multiobjective programming problem under strong invexity and its generalizations of order σ. Weak and strong duality theorems are established for a Mond-Weir type dual.

Original languageEnglish
Article number309
JournalJournal of Inequalities and Applications
Volume2015
Issue number1
DOIs
StatePublished - 1 Dec 2015

Bibliographical note

Publisher Copyright:
© 2015, Ahmad and Al-Homidan.

Keywords

  • duality
  • locally Lipschitz function
  • multiobjective programming
  • optimality conditions
  • strict minimizer

ASJC Scopus subject areas

  • Analysis
  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Sufficiency and duality in nondifferentiable multiobjective programming involving higher order strong invexity'. Together they form a unique fingerprint.

Cite this